NO This is Ultimate 0.2.2-dev-e7f90c1-m [2023-02-13 03:41:01,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 03:41:01,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 03:41:01,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 03:41:01,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 03:41:01,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 03:41:01,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 03:41:01,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 03:41:01,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 03:41:01,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 03:41:01,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 03:41:01,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 03:41:01,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 03:41:01,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 03:41:01,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 03:41:01,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 03:41:01,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 03:41:01,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 03:41:01,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 03:41:01,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 03:41:01,070 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2023-02-13 03:41:01,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 03:41:01,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 03:41:01,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 03:41:01,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 03:41:01,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 03:41:01,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 03:41:01,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 03:41:01,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 03:41:01,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 03:41:01,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 03:41:01,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 03:41:01,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 03:41:01,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 03:41:01,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 03:41:01,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 03:41:01,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 03:41:01,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 03:41:01,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 03:41:01,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 03:41:01,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 03:41:01,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 03:41:01,078 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/Ultimate/./../termcomp2017.epf [2023-02-13 03:41:01,089 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 03:41:01,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 03:41:01,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Rewrite not-equals=true [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 03:41:01,090 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-13 03:41:01,090 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:01,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2023-02-13 03:41:01,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2023-02-13 03:41:01,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:41:01,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 03:41:01,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 03:41:01,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 03:41:01,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/export/starexec/sandbox/solver/Ultimate/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-02-13 03:41:01,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 03:41:01,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 03:41:01,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 03:41:01,253 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 03:41:01,253 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 03:41:01,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:41:01,289 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c1b4b54b0f7d4aabac9362c2631d6d8a/FLAG32b4ad393 [2023-02-13 03:41:01,665 INFO L306 CDTParser]: Found 1 translation units. [2023-02-13 03:41:01,665 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:41:01,670 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c1b4b54b0f7d4aabac9362c2631d6d8a/FLAG32b4ad393 [2023-02-13 03:41:02,104 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c1b4b54b0f7d4aabac9362c2631d6d8a [2023-02-13 03:41:02,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 03:41:02,109 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2023-02-13 03:41:02,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 03:41:02,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 03:41:02,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 03:41:02,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f9f0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 03:41:02,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 03:41:02,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:41:02,201 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 03:41:02,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:41:02,216 INFO L208 MainTranslator]: Completed translation [2023-02-13 03:41:02,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02 WrapperNode [2023-02-13 03:41:02,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 03:41:02,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 03:41:02,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 03:41:02,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 03:41:02,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,232 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2023-02-13 03:41:02,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 03:41:02,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 03:41:02,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 03:41:02,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 03:41:02,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 03:41:02,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 03:41:02,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 03:41:02,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 03:41:02,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:41:02,255 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,268 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Waiting until timeout for monitored process [2023-02-13 03:41:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 03:41:02,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 03:41:02,335 INFO L234 CfgBuilder]: Building ICFG [2023-02-13 03:41:02,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 03:41:02,407 INFO L275 CfgBuilder]: Performing block encoding [2023-02-13 03:41:02,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 03:41:02,411 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 03:41:02,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02 BoogieIcfgContainer [2023-02-13 03:41:02,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 03:41:02,413 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2023-02-13 03:41:02,413 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2023-02-13 03:41:02,414 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2023-02-13 03:41:02,415 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,425 INFO L313 BlockEncoder]: Initial Icfg 13 locations, 20 edges [2023-02-13 03:41:02,426 INFO L258 BlockEncoder]: Using Remove infeasible edges [2023-02-13 03:41:02,426 INFO L263 BlockEncoder]: Using Maximize final states [2023-02-13 03:41:02,427 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2023-02-13 03:41:02,427 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:41:02,427 INFO L296 BlockEncoder]: Using Remove sink states [2023-02-13 03:41:02,428 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2023-02-13 03:41:02,428 INFO L179 BlockEncoder]: Using Rewrite not-equals [2023-02-13 03:41:02,436 INFO L185 BlockEncoder]: Using Use SBE [2023-02-13 03:41:02,443 INFO L200 BlockEncoder]: SBE split 1 edges [2023-02-13 03:41:02,446 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2023-02-13 03:41:02,446 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:41:02,451 INFO L101 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2023-02-13 03:41:02,452 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2023-02-13 03:41:02,453 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2023-02-13 03:41:02,453 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:41:02,453 INFO L101 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2023-02-13 03:41:02,453 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2023-02-13 03:41:02,453 INFO L313 BlockEncoder]: Encoded RCFG 8 locations, 15 edges [2023-02-13 03:41:02,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:41:02 BasicIcfg [2023-02-13 03:41:02,454 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2023-02-13 03:41:02,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 03:41:02,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 03:41:02,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 03:41:02,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 03:41:02" (1/4) ... [2023-02-13 03:41:02,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65889a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (2/4) ... [2023-02-13 03:41:02,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65889a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02" (3/4) ... [2023-02-13 03:41:02,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65889a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:41:02" (4/4) ... [2023-02-13 03:41:02,458 INFO L111 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:41:02,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-02-13 03:41:02,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 0 error locations. [2023-02-13 03:41:02,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65889a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 03:41:02,469 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-13 03:41:02,469 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-13 03:41:02,471 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-13 03:41:02,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.02 03:41:02" (1/4) ... [2023-02-13 03:41:02,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147d2f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:02" (2/4) ... [2023-02-13 03:41:02,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147d2f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02" (3/4) ... [2023-02-13 03:41:02,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147d2f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:41:02" (4/4) ... [2023-02-13 03:41:02,473 INFO L322 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:41:02,503 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2023-02-13 03:41:02,503 INFO L302 stractBuchiCegarLoop]: Hoare is true [2023-02-13 03:41:02,503 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-13 03:41:02,503 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-13 03:41:02,503 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-13 03:41:02,503 INFO L306 stractBuchiCegarLoop]: Difference is false [2023-02-13 03:41:02,503 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-13 03:41:02,503 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-13 03:41:02,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:02,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-02-13 03:41:02,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:02,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:02,525 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:41:02,525 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-13 03:41:02,526 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-13 03:41:02,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:02,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-02-13 03:41:02,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:02,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:02,527 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:41:02,527 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-13 03:41:02,530 INFO L733 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 8#L34-2true [2023-02-13 03:41:02,530 INFO L735 eck$LassoCheckResult]: Loop: 8#L34-2true [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 9#L12true [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 7#L14true [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8#L34-2true [2023-02-13 03:41:02,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 113, now seen corresponding path program 1 times [2023-02-13 03:41:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,540 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068515924] [2023-02-13 03:41:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash 96423, now seen corresponding path program 1 times [2023-02-13 03:41:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,599 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169735304] [2023-02-13 03:41:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,606 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash 3433015, now seen corresponding path program 1 times [2023-02-13 03:41:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,611 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280519995] [2023-02-13 03:41:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,617 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,664 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:02,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:02,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:02,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:02,665 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:02,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:02,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:02,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2023-02-13 03:41:02,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:02,666 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:02,673 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,679 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,681 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,717 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:02,718 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:02,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,719 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,721 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-13 03:41:02,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:02,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,735 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:02,735 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:02,757 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:02,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,760 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-13 03:41:02,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:02,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,769 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:02,769 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:02,804 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-13 03:41:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,805 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,808 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-13 03:41:02,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:02,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,849 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-13 03:41:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,851 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,853 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-13 03:41:02,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:02,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,908 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:02,910 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-13 03:41:02,910 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:02,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:02,911 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:02,911 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:02,911 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:02,911 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:02,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:02,912 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2023-02-13 03:41:02,912 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:02,912 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:02,914 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,919 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,975 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:02,997 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:02,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,998 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:03,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:03,020 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-13 03:41:03,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:03,044 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:03,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,046 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-13 03:41:03,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:03,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:03,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:03,072 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-02-13 03:41:03,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,073 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,074 INFO L229 MonitoredProcess]: Starting monitored process 8 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,074 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-13 03:41:03,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:03,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:03,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:03,084 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:03,089 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:03,090 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:41:03,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,091 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,099 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-13 03:41:03,099 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:03,100 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:03,100 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:03,100 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2023-02-13 03:41:03,116 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-13 03:41:03,118 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,137 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,219 INFO L100 LoopCannibalizer]: 1 predicates before loop cannibalization 3 predicates after loop cannibalization [2023-02-13 03:41:03,223 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-13 03:41:03,224 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,293 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 70 transitions. Complement of second has 6 states. [2023-02-13 03:41:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2023-02-13 03:41:03,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 3 letters. [2023-02-13 03:41:03,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 4 letters. Loop has 3 letters. [2023-02-13 03:41:03,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 6 letters. [2023-02-13 03:41:03,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 70 transitions. [2023-02-13 03:41:03,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-13 03:41:03,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 70 transitions. [2023-02-13 03:41:03,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-13 03:41:03,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-02-13 03:41:03,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 70 transitions. [2023-02-13 03:41:03,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:03,309 INFO L220 hiAutomatonCegarLoop]: Abstraction has 40 states and 70 transitions. [2023-02-13 03:41:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 70 transitions. [2023-02-13 03:41:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-02-13 03:41:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2023-02-13 03:41:03,325 INFO L242 hiAutomatonCegarLoop]: Abstraction has 37 states and 66 transitions. [2023-02-13 03:41:03,325 INFO L426 stractBuchiCegarLoop]: Abstraction has 37 states and 66 transitions. [2023-02-13 03:41:03,325 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-13 03:41:03,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 66 transitions. [2023-02-13 03:41:03,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-13 03:41:03,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:03,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:03,326 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-13 03:41:03,327 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:41:03,327 INFO L733 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 98#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 119#L12 [2023-02-13 03:41:03,327 INFO L735 eck$LassoCheckResult]: Loop: 119#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 123#L25 [59] L25-->L27: Formula: (and (< 0 |v_ULTIMATE.start_main_~i~0#1_19|) (= |v_ULTIMATE.start_main_~i~0#1_18| (+ |v_ULTIMATE.start_main_~i~0#1_19| (- 1))) (< |v_ULTIMATE.start_main_~j~0#1_21| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_21|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_21|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 125#L27 [78] L27-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_6| 1) 0) (= |v_ULTIMATE.start_main_~i~0#1_4| (+ |v_ULTIMATE.start_main_~i~0#1_5| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 129#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 119#L12 [2023-02-13 03:41:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash 3570, now seen corresponding path program 1 times [2023-02-13 03:41:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,328 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122438058] [2023-02-13 03:41:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash 3187239, now seen corresponding path program 1 times [2023-02-13 03:41:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,333 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617714333] [2023-02-13 03:41:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:03,351 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617714333] [2023-02-13 03:41:03,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617714333] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:41:03,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:41:03,352 ERROR L191 FreeRefinementEngine]: {133#true} [135#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|), 134#false, 134#false] {134#false} [2023-02-13 03:41:03,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:41:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752669316] [2023-02-13 03:41:03,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:41:03,354 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:03,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:41:03,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:41:03,357 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:03,370 INFO L93 Difference]: Finished difference Result 32 states and 53 transitions. [2023-02-13 03:41:03,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 53 transitions. [2023-02-13 03:41:03,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-02-13 03:41:03,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 53 transitions. [2023-02-13 03:41:03,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-02-13 03:41:03,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-02-13 03:41:03,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 53 transitions. [2023-02-13 03:41:03,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:03,372 INFO L220 hiAutomatonCegarLoop]: Abstraction has 32 states and 53 transitions. [2023-02-13 03:41:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 53 transitions. [2023-02-13 03:41:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-13 03:41:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.65625) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2023-02-13 03:41:03,374 INFO L242 hiAutomatonCegarLoop]: Abstraction has 32 states and 53 transitions. [2023-02-13 03:41:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:41:03,376 INFO L426 stractBuchiCegarLoop]: Abstraction has 32 states and 53 transitions. [2023-02-13 03:41:03,376 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-13 03:41:03,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 53 transitions. [2023-02-13 03:41:03,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-02-13 03:41:03,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:03,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:03,377 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-13 03:41:03,377 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2023-02-13 03:41:03,377 INFO L733 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 173#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 186#L12 [2023-02-13 03:41:03,377 INFO L735 eck$LassoCheckResult]: Loop: 186#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 188#L25 [80] L25-->L34: Formula: (and (>= 0 |v_ULTIMATE.start_main_~i~0#1_7|) (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 194#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 196#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 195#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 177#L25 [80] L25-->L34: Formula: (and (>= 0 |v_ULTIMATE.start_main_~i~0#1_7|) (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 178#L34 [79] L34-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~i~0#1_11| (* |v_ULTIMATE.start_main_~j~0#1_11| 2)) (= |v_ULTIMATE.start_main_~j~0#1_10| (+ |v_ULTIMATE.start_main_~j~0#1_11| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_11|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 199#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 186#L12 [2023-02-13 03:41:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 3570, now seen corresponding path program 2 times [2023-02-13 03:41:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,378 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203565610] [2023-02-13 03:41:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1691716000, now seen corresponding path program 1 times [2023-02-13 03:41:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,383 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651730983] [2023-02-13 03:41:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:03,392 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651730983] [2023-02-13 03:41:03,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651730983] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:41:03,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:41:03,393 ERROR L191 FreeRefinementEngine]: {203#true} [203#true, 203#true, 203#true, 205#(not (<= |ULTIMATE.start_main_~i~0#1| 0)), 205#(not (<= |ULTIMATE.start_main_~i~0#1| 0)), 204#false, 204#false] {204#false} [2023-02-13 03:41:03,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 03:41:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752312598] [2023-02-13 03:41:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:41:03,393 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:41:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:41:03,394 INFO L87 Difference]: Start difference. First operand 32 states and 53 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:03,404 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2023-02-13 03:41:03,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2023-02-13 03:41:03,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-02-13 03:41:03,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 43 transitions. [2023-02-13 03:41:03,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-13 03:41:03,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-13 03:41:03,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2023-02-13 03:41:03,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:03,405 INFO L220 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-13 03:41:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2023-02-13 03:41:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-13 03:41:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-02-13 03:41:03,407 INFO L242 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-13 03:41:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:41:03,408 INFO L426 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-13 03:41:03,408 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-13 03:41:03,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2023-02-13 03:41:03,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-02-13 03:41:03,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:03,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:03,408 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-13 03:41:03,409 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2023-02-13 03:41:03,409 INFO L733 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 242#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 259#L12 [2023-02-13 03:41:03,409 INFO L735 eck$LassoCheckResult]: Loop: 259#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 246#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 247#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 253#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 254#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 250#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 236#L16 [53] L16-->L34-2: Formula: (and (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_~i~0#1_15| 1)) (< (+ |v_ULTIMATE.start_main_~j~0#1_15| 2) |v_ULTIMATE.start_main_~i~0#1_15|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 237#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 259#L12 [2023-02-13 03:41:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 3570, now seen corresponding path program 3 times [2023-02-13 03:41:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,409 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73435405] [2023-02-13 03:41:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -804348626, now seen corresponding path program 1 times [2023-02-13 03:41:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,414 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798120219] [2023-02-13 03:41:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:03,438 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798120219] [2023-02-13 03:41:03,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798120219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:41:03,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:41:03,438 ERROR L191 FreeRefinementEngine]: {268#true} [270#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|), 271#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|), 272#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)), 272#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)), 273#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)), 272#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)), 269#false] {269#false} [2023-02-13 03:41:03,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 03:41:03,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245864854] [2023-02-13 03:41:03,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:41:03,439 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:03,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:03,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 03:41:03,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-13 03:41:03,439 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:03,463 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2023-02-13 03:41:03,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2023-02-13 03:41:03,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2023-02-13 03:41:03,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2023-02-13 03:41:03,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-02-13 03:41:03,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-13 03:41:03,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2023-02-13 03:41:03,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:03,465 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-02-13 03:41:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2023-02-13 03:41:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2023-02-13 03:41:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2023-02-13 03:41:03,467 INFO L242 hiAutomatonCegarLoop]: Abstraction has 36 states and 53 transitions. [2023-02-13 03:41:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 03:41:03,468 INFO L426 stractBuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2023-02-13 03:41:03,468 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-13 03:41:03,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2023-02-13 03:41:03,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-13 03:41:03,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:03,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:03,469 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:41:03,469 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2023-02-13 03:41:03,469 INFO L733 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 323#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 344#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 345#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 353#L16 [2023-02-13 03:41:03,469 INFO L735 eck$LassoCheckResult]: Loop: 353#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 326#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 339#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 340#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 324#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 325#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 336#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 349#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 320#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 321#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 355#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 354#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 353#L16 [2023-02-13 03:41:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 3433003, now seen corresponding path program 1 times [2023-02-13 03:41:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,470 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150931222] [2023-02-13 03:41:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1462840027, now seen corresponding path program 1 times [2023-02-13 03:41:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,476 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833996542] [2023-02-13 03:41:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1157580879, now seen corresponding path program 1 times [2023-02-13 03:41:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,488 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24763529] [2023-02-13 03:41:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,550 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,550 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,550 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,550 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,550 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:03,550 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,550 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,550 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,550 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2023-02-13 03:41:03,550 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,550 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,551 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,553 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,555 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,586 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,586 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:03,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,587 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,587 INFO L229 MonitoredProcess]: Starting monitored process 10 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,588 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-13 03:41:03,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:03,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,595 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:03,595 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:03,609 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,611 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-13 03:41:03,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:03,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,619 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:03,619 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:03,634 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-02-13 03:41:03,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,636 INFO L229 MonitoredProcess]: Starting monitored process 12 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,637 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-13 03:41:03,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:03,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,659 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-02-13 03:41:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,661 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,662 INFO L229 MonitoredProcess]: Starting monitored process 13 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,663 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-13 03:41:03,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:03,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,733 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:03,737 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-02-13 03:41:03,737 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:03,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2023-02-13 03:41:03,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,738 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,738 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,742 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,748 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,827 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,828 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:03,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,829 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,830 INFO L229 MonitoredProcess]: Starting monitored process 14 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,831 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-13 03:41:03,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:03,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:03,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:03,890 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:03,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,891 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,892 INFO L229 MonitoredProcess]: Starting monitored process 15 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,893 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-13 03:41:03,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:03,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:03,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:03,947 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-13 03:41:03,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,948 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,949 INFO L229 MonitoredProcess]: Starting monitored process 16 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,950 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-13 03:41:03,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:03,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:03,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:03,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:03,967 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:03,967 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:03,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,972 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-13 03:41:03,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:03,973 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:03,973 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:03,973 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 7 Supporting invariants [] [2023-02-13 03:41:03,999 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-02-13 03:41:04,001 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,124 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-02-13 03:41:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,138 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-02-13 03:41:04,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,400 INFO L100 LoopCannibalizer]: 3 predicates before loop cannibalization 8 predicates after loop cannibalization [2023-02-13 03:41:04,400 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2023-02-13 03:41:04,400 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states and 53 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,501 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states and 53 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 383 states and 554 transitions. Complement of second has 51 states. [2023-02-13 03:41:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2023-02-13 03:41:04,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 4 letters. Loop has 12 letters. [2023-02-13 03:41:04,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 16 letters. Loop has 12 letters. [2023-02-13 03:41:04,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 4 letters. Loop has 24 letters. [2023-02-13 03:41:04,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 554 transitions. [2023-02-13 03:41:04,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 318 [2023-02-13 03:41:04,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 339 states and 492 transitions. [2023-02-13 03:41:04,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2023-02-13 03:41:04,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2023-02-13 03:41:04,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 339 states and 492 transitions. [2023-02-13 03:41:04,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,509 INFO L220 hiAutomatonCegarLoop]: Abstraction has 339 states and 492 transitions. [2023-02-13 03:41:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states and 492 transitions. [2023-02-13 03:41:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 227. [2023-02-13 03:41:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 227 states have (on average 1.4889867841409692) internal successors, (338), 226 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 338 transitions. [2023-02-13 03:41:04,517 INFO L242 hiAutomatonCegarLoop]: Abstraction has 227 states and 338 transitions. [2023-02-13 03:41:04,517 INFO L426 stractBuchiCegarLoop]: Abstraction has 227 states and 338 transitions. [2023-02-13 03:41:04,517 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-13 03:41:04,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 338 transitions. [2023-02-13 03:41:04,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2023-02-13 03:41:04,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:04,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:04,518 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:41:04,518 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2023-02-13 03:41:04,518 INFO L733 eck$LassoCheckResult]: Stem: 1103#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 1104#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1224#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1292#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1294#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1283#L34-2 [2023-02-13 03:41:04,519 INFO L735 eck$LassoCheckResult]: Loop: 1283#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1312#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 1311#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1307#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1306#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1305#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 1302#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1282#L34 [79] L34-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~i~0#1_11| (* |v_ULTIMATE.start_main_~j~0#1_11| 2)) (= |v_ULTIMATE.start_main_~j~0#1_10| (+ |v_ULTIMATE.start_main_~j~0#1_11| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_11|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_10|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1283#L34-2 [2023-02-13 03:41:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash 106423170, now seen corresponding path program 1 times [2023-02-13 03:41:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,519 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135376109] [2023-02-13 03:41:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1663652992, now seen corresponding path program 1 times [2023-02-13 03:41:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,526 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513694898] [2023-02-13 03:41:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 03:41:04,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:04,541 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513694898] [2023-02-13 03:41:04,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513694898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:41:04,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:41:04,541 ERROR L191 FreeRefinementEngine]: {1329#true} [1329#true, 1329#true, 1329#true, 1329#true, 1331#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1332#(<= (+ 3 |ULTIMATE.start_main_~i~0#1|) (* 2 |ULTIMATE.start_main_~j~0#1|)), 1333#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (* 2 |ULTIMATE.start_main_~j~0#1|))] {1330#false} [2023-02-13 03:41:04,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 03:41:04,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218276550] [2023-02-13 03:41:04,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:41:04,541 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 03:41:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-13 03:41:04,542 INFO L87 Difference]: Start difference. First operand 227 states and 338 transitions. cyclomatic complexity: 113 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:04,559 INFO L93 Difference]: Finished difference Result 150 states and 220 transitions. [2023-02-13 03:41:04,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 220 transitions. [2023-02-13 03:41:04,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 125 [2023-02-13 03:41:04,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 146 states and 214 transitions. [2023-02-13 03:41:04,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2023-02-13 03:41:04,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2023-02-13 03:41:04,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 214 transitions. [2023-02-13 03:41:04,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,561 INFO L220 hiAutomatonCegarLoop]: Abstraction has 146 states and 214 transitions. [2023-02-13 03:41:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 214 transitions. [2023-02-13 03:41:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-02-13 03:41:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.4788732394366197) internal successors, (210), 141 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 210 transitions. [2023-02-13 03:41:04,564 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 210 transitions. [2023-02-13 03:41:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 03:41:04,566 INFO L426 stractBuchiCegarLoop]: Abstraction has 142 states and 210 transitions. [2023-02-13 03:41:04,566 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-13 03:41:04,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 210 transitions. [2023-02-13 03:41:04,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2023-02-13 03:41:04,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:04,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:04,567 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:41:04,567 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 3, 2, 2, 2, 2, 2, 1] [2023-02-13 03:41:04,567 INFO L733 eck$LassoCheckResult]: Stem: 1492#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 1493#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1587#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1595#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1592#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1593#L34-2 [2023-02-13 03:41:04,567 INFO L735 eck$LassoCheckResult]: Loop: 1593#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1510#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 1511#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1620#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1621#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1629#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1512#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1513#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1627#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 1497#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1498#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1614#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1609#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1604#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1600#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1491#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1569#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1570#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1594#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1593#L34-2 [2023-02-13 03:41:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,567 INFO L85 PathProgramCache]: Analyzing trace with hash 106423170, now seen corresponding path program 2 times [2023-02-13 03:41:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,568 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696052537] [2023-02-13 03:41:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -149102583, now seen corresponding path program 1 times [2023-02-13 03:41:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,574 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349403552] [2023-02-13 03:41:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:04,601 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349403552] [2023-02-13 03:41:04,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349403552] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:04,601 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417621818] [2023-02-13 03:41:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,602 INFO L229 MonitoredProcess]: Starting monitored process 18 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,604 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-13 03:41:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-13 03:41:04,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-13 03:41:04,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417621818] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:41:04,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-13 03:41:04,640 ERROR L191 FreeRefinementEngine]: {1633#true} [1633#true, 1633#true, 1633#true, 1633#true, 1633#true, 1659#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 1663#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 1663#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 1634#false, 1634#false, 1634#false, 1634#false, 1634#false, 1634#false, 1634#false, 1634#false, 1634#false, 1634#false] {1634#false} [2023-02-13 03:41:04,640 ERROR L197 FreeRefinementEngine]: {1633#true} [1635#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1635#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1636#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1636#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1636#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1637#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1637#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1637#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1638#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1638#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1639#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1639#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1639#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1638#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1640#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1640#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1640#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1634#false] {1634#false} [2023-02-13 03:41:04,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-02-13 03:41:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133026228] [2023-02-13 03:41:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:41:04,641 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 03:41:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-13 03:41:04,641 INFO L87 Difference]: Start difference. First operand 142 states and 210 transitions. cyclomatic complexity: 70 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:04,655 INFO L93 Difference]: Finished difference Result 147 states and 206 transitions. [2023-02-13 03:41:04,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 206 transitions. [2023-02-13 03:41:04,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2023-02-13 03:41:04,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 206 transitions. [2023-02-13 03:41:04,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-02-13 03:41:04,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-02-13 03:41:04,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 206 transitions. [2023-02-13 03:41:04,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,658 INFO L220 hiAutomatonCegarLoop]: Abstraction has 147 states and 206 transitions. [2023-02-13 03:41:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 206 transitions. [2023-02-13 03:41:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2023-02-13 03:41:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 1.4068965517241379) internal successors, (204), 144 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 204 transitions. [2023-02-13 03:41:04,664 INFO L242 hiAutomatonCegarLoop]: Abstraction has 145 states and 204 transitions. [2023-02-13 03:41:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 03:41:04,665 INFO L426 stractBuchiCegarLoop]: Abstraction has 145 states and 204 transitions. [2023-02-13 03:41:04,665 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-13 03:41:04,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 204 transitions. [2023-02-13 03:41:04,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2023-02-13 03:41:04,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:04,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:04,667 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:41:04,667 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 3, 3, 3, 2, 2, 2] [2023-02-13 03:41:04,667 INFO L733 eck$LassoCheckResult]: Stem: 1848#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 1849#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1949#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1950#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1974#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1964#L34-2 [2023-02-13 03:41:04,667 INFO L735 eck$LassoCheckResult]: Loop: 1964#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1961#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 1960#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1959#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1958#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1957#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 1955#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1953#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1951#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1947#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 1937#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1941#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1939#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1936#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1934#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1933#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1905#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 1922#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1917#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1885#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 1964#L34-2 [2023-02-13 03:41:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 106423170, now seen corresponding path program 3 times [2023-02-13 03:41:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,668 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142167372] [2023-02-13 03:41:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1691694417, now seen corresponding path program 2 times [2023-02-13 03:41:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,675 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282286863] [2023-02-13 03:41:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:04,700 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282286863] [2023-02-13 03:41:04,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282286863] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:04,701 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585185229] [2023-02-13 03:41:04,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 03:41:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,702 INFO L229 MonitoredProcess]: Starting monitored process 19 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,705 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-13 03:41:04,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 03:41:04,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:41:04,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585185229] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:04,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:04,767 ERROR L197 FreeRefinementEngine]: {1992#true} [1994#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1994#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1993#false] {1993#false} [2023-02-13 03:41:04,767 ERROR L197 FreeRefinementEngine]: {1992#true} [1994#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1994#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1993#false] {1993#false} [2023-02-13 03:41:04,767 ERROR L197 FreeRefinementEngine]: {1992#true} [1994#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1994#(<= 1 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1995#(<= 2 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1996#(<= 3 |ULTIMATE.start_main_~i~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1998#(<= 3 |ULTIMATE.start_main_~j~0#1|), 1997#(<= 4 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1999#(<= 5 |ULTIMATE.start_main_~j~0#1|), 1993#false] {1993#false} [2023-02-13 03:41:04,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-02-13 03:41:04,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235996649] [2023-02-13 03:41:04,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:04,767 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:04,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-13 03:41:04,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-13 03:41:04,768 INFO L87 Difference]: Start difference. First operand 145 states and 204 transitions. cyclomatic complexity: 62 Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:04,821 INFO L93 Difference]: Finished difference Result 238 states and 321 transitions. [2023-02-13 03:41:04,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 321 transitions. [2023-02-13 03:41:04,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 [2023-02-13 03:41:04,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 238 states and 321 transitions. [2023-02-13 03:41:04,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2023-02-13 03:41:04,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2023-02-13 03:41:04,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 321 transitions. [2023-02-13 03:41:04,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,824 INFO L220 hiAutomatonCegarLoop]: Abstraction has 238 states and 321 transitions. [2023-02-13 03:41:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 321 transitions. [2023-02-13 03:41:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 172. [2023-02-13 03:41:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 171 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2023-02-13 03:41:04,829 INFO L242 hiAutomatonCegarLoop]: Abstraction has 172 states and 234 transitions. [2023-02-13 03:41:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-13 03:41:04,833 INFO L426 stractBuchiCegarLoop]: Abstraction has 172 states and 234 transitions. [2023-02-13 03:41:04,834 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-13 03:41:04,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 234 transitions. [2023-02-13 03:41:04,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2023-02-13 03:41:04,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:04,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:04,835 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-02-13 03:41:04,835 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-02-13 03:41:04,835 INFO L733 eck$LassoCheckResult]: Stem: 2367#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 2368#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2475#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2474#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2473#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2365#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2528#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 2527#L25 [2023-02-13 03:41:04,835 INFO L735 eck$LassoCheckResult]: Loop: 2527#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2524#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2519#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2518#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2386#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2387#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2521#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2522#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2526#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2363#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2380#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 2527#L25 [2023-02-13 03:41:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash -806546583, now seen corresponding path program 1 times [2023-02-13 03:41:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,836 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957053049] [2023-02-13 03:41:04,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,841 INFO L85 PathProgramCache]: Analyzing trace with hash 852220588, now seen corresponding path program 2 times [2023-02-13 03:41:04,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,841 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781227873] [2023-02-13 03:41:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:04,858 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781227873] [2023-02-13 03:41:04,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781227873] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:04,858 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977685590] [2023-02-13 03:41:04,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 03:41:04,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:04,858 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,859 INFO L229 MonitoredProcess]: Starting monitored process 20 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,860 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-13 03:41:04,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 03:41:04,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:41:04,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977685590] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:04,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:04,903 ERROR L197 FreeRefinementEngine]: {2537#true} [2537#true, 2537#true, 2537#true, 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2540#(<= 6 |ULTIMATE.start_main_~i~0#1|), 2540#(<= 6 |ULTIMATE.start_main_~i~0#1|), 2541#(<= 7 |ULTIMATE.start_main_~i~0#1|), 2542#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|)] {2538#false} [2023-02-13 03:41:04,903 ERROR L197 FreeRefinementEngine]: {2537#true} [2537#true, 2537#true, 2537#true, 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2542#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2542#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2564#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2542#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|)] {2538#false} [2023-02-13 03:41:04,903 ERROR L197 FreeRefinementEngine]: {2537#true} [2537#true, 2537#true, 2537#true, 2577#(not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)), 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2542#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2539#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2577#(not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)), 2577#(not (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))] {2538#false} [2023-02-13 03:41:04,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2023-02-13 03:41:04,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44367210] [2023-02-13 03:41:04,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:04,903 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:04,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-13 03:41:04,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-13 03:41:04,904 INFO L87 Difference]: Start difference. First operand 172 states and 234 transitions. cyclomatic complexity: 65 Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:04,934 INFO L93 Difference]: Finished difference Result 192 states and 246 transitions. [2023-02-13 03:41:04,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 246 transitions. [2023-02-13 03:41:04,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 136 [2023-02-13 03:41:04,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 246 transitions. [2023-02-13 03:41:04,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2023-02-13 03:41:04,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2023-02-13 03:41:04,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 246 transitions. [2023-02-13 03:41:04,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,936 INFO L220 hiAutomatonCegarLoop]: Abstraction has 192 states and 246 transitions. [2023-02-13 03:41:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 246 transitions. [2023-02-13 03:41:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2023-02-13 03:41:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.3333333333333333) internal successors, (212), 158 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. [2023-02-13 03:41:04,938 INFO L242 hiAutomatonCegarLoop]: Abstraction has 159 states and 212 transitions. [2023-02-13 03:41:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-13 03:41:04,939 INFO L426 stractBuchiCegarLoop]: Abstraction has 159 states and 212 transitions. [2023-02-13 03:41:04,940 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-13 03:41:04,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 212 transitions. [2023-02-13 03:41:04,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 133 [2023-02-13 03:41:04,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:04,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:04,940 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-02-13 03:41:04,940 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2023-02-13 03:41:04,941 INFO L733 eck$LassoCheckResult]: Stem: 2814#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 2815#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2856#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2855#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2854#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2836#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2915#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 2820#L25 [2023-02-13 03:41:04,941 INFO L735 eck$LassoCheckResult]: Loop: 2820#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2821#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2914#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2913#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 2912#L25 [81] L25-->L34: Formula: (and (= (+ |v_ULTIMATE.start_main_~i~0#1_7| 1) |v_ULTIMATE.start_main_~i~0#1_6|) (>= |v_ULTIMATE.start_main_~j~0#1_7| 0)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2911#L34 [68] L34-->L34-2: Formula: (and (< |v_ULTIMATE.start_main_~i~0#1_9| (* 2 |v_ULTIMATE.start_main_~j~0#1_9|)) (= (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_9|) |v_ULTIMATE.start_main_~j~0#1_8|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_9|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_8|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2910#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2908#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2909#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2834#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 2817#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 2833#L12 [74] L12-->L25: Formula: (> |v_ULTIMATE.start_main_~j~0#1_20| |v_ULTIMATE.start_main_~i~0#1_17|) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_20|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_17|} AuxVars[] AssignedVars[] 2820#L25 [2023-02-13 03:41:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash -806546583, now seen corresponding path program 2 times [2023-02-13 03:41:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,941 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029276501] [2023-02-13 03:41:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,944 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash 388784582, now seen corresponding path program 3 times [2023-02-13 03:41:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,946 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516290238] [2023-02-13 03:41:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash 172988718, now seen corresponding path program 2 times [2023-02-13 03:41:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,954 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844205038] [2023-02-13 03:41:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:04,988 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844205038] [2023-02-13 03:41:04,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844205038] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:04,988 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741842802] [2023-02-13 03:41:04,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 03:41:04,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:04,989 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,989 INFO L229 MonitoredProcess]: Starting monitored process 21 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,999 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-13 03:41:05,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 03:41:05,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:41:05,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-13 03:41:05,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-13 03:41:05,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741842802] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:05,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:05,071 ERROR L197 FreeRefinementEngine]: {2972#true} [2974#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0), 2974#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0), 2975#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2975#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2975#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2975#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2978#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2979#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2979#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2980#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~i~0#1|), 2979#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2978#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|), 2978#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|)] {2973#false} [2023-02-13 03:41:05,071 ERROR L197 FreeRefinementEngine]: {2972#true} [2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2975#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2975#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2975#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 2973#false, 2973#false, 2973#false, 2973#false, 2973#false, 2973#false, 2973#false, 2973#false] {2973#false} [2023-02-13 03:41:05,071 ERROR L197 FreeRefinementEngine]: {2972#true} [2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 3071#(< |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)), 3071#(< |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)), 3071#(< |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)), 2977#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2976#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|), 2973#false, 2973#false, 2973#false, 2973#false, 2973#false, 2973#false, 2973#false, 2973#false] {2973#false} [2023-02-13 03:41:05,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 9 [2023-02-13 03:41:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135280816] [2023-02-13 03:41:05,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:05,123 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:05,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:05,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:05,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:05,124 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:05,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:05,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:05,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:05,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:41:05,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:05,125 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:05,126 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,136 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,193 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:05,194 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:05,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:05,194 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,196 INFO L229 MonitoredProcess]: Starting monitored process 22 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,202 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-13 03:41:05,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:05,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:05,241 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-02-13 03:41:05,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:05,243 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,244 INFO L229 MonitoredProcess]: Starting monitored process 23 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,246 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-13 03:41:05,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:05,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:05,335 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:05,337 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-13 03:41:05,338 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:05,338 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:05,338 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:05,338 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:05,338 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:05,338 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:05,338 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:05,338 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:05,338 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:41:05,338 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:05,339 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:05,339 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,357 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,411 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:05,411 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:05,412 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,413 INFO L229 MonitoredProcess]: Starting monitored process 24 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,415 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-13 03:41:05,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:05,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:05,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:05,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:05,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:05,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:05,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:05,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:05,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:05,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:05,441 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:05,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:05,442 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,443 INFO L229 MonitoredProcess]: Starting monitored process 25 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,446 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-13 03:41:05,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:05,447 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:05,447 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:05,447 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2023-02-13 03:41:05,483 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-13 03:41:05,484 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:05,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,470 INFO L100 LoopCannibalizer]: 6 predicates before loop cannibalization 17 predicates after loop cannibalization [2023-02-13 03:41:06,470 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2023-02-13 03:41:06,471 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 159 states and 212 transitions. cyclomatic complexity: 56 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:08,412 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 159 states and 212 transitions. cyclomatic complexity: 56. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3592 states and 4549 transitions. Complement of second has 303 states. [2023-02-13 03:41:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 31 states 1 stem states 26 non-accepting loop states 3 accepting loop states [2023-02-13 03:41:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 82 transitions. [2023-02-13 03:41:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 82 transitions. Stem has 7 letters. Loop has 12 letters. [2023-02-13 03:41:08,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 82 transitions. Stem has 19 letters. Loop has 12 letters. [2023-02-13 03:41:08,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:08,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 82 transitions. Stem has 7 letters. Loop has 24 letters. [2023-02-13 03:41:08,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:08,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3592 states and 4549 transitions. [2023-02-13 03:41:08,447 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2023-02-13 03:41:08,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3592 states to 1006 states and 1275 transitions. [2023-02-13 03:41:08,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2023-02-13 03:41:08,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2023-02-13 03:41:08,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1006 states and 1275 transitions. [2023-02-13 03:41:08,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:08,453 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1006 states and 1275 transitions. [2023-02-13 03:41:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states and 1275 transitions. [2023-02-13 03:41:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 446. [2023-02-13 03:41:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 446 states have (on average 1.4260089686098654) internal successors, (636), 445 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 636 transitions. [2023-02-13 03:41:08,462 INFO L242 hiAutomatonCegarLoop]: Abstraction has 446 states and 636 transitions. [2023-02-13 03:41:08,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-13 03:41:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2023-02-13 03:41:08,463 INFO L87 Difference]: Start difference. First operand 446 states and 636 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:08,522 INFO L93 Difference]: Finished difference Result 246 states and 290 transitions. [2023-02-13 03:41:08,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 290 transitions. [2023-02-13 03:41:08,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2023-02-13 03:41:08,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 124 states and 139 transitions. [2023-02-13 03:41:08,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2023-02-13 03:41:08,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2023-02-13 03:41:08,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 139 transitions. [2023-02-13 03:41:08,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:08,525 INFO L220 hiAutomatonCegarLoop]: Abstraction has 124 states and 139 transitions. [2023-02-13 03:41:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 139 transitions. [2023-02-13 03:41:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2023-02-13 03:41:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.15) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2023-02-13 03:41:08,527 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 92 transitions. [2023-02-13 03:41:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 03:41:08,528 INFO L426 stractBuchiCegarLoop]: Abstraction has 80 states and 92 transitions. [2023-02-13 03:41:08,529 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-13 03:41:08,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 92 transitions. [2023-02-13 03:41:08,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-02-13 03:41:08,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:08,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:08,530 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-13 03:41:08,530 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2023-02-13 03:41:08,530 INFO L733 eck$LassoCheckResult]: Stem: 8129#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 8130#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8145#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8136#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8137#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8181#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8180#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8172#L16 [77] L16-->L34-2: Formula: (and (>= (+ |v_ULTIMATE.start_main_~j~0#1_17| 2) |v_ULTIMATE.start_main_~i~0#1_16|) (= |v_ULTIMATE.start_main_~j~0#1_16| (+ |v_ULTIMATE.start_main_~j~0#1_17| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_17|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_16|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8170#L34-2 [2023-02-13 03:41:08,530 INFO L735 eck$LassoCheckResult]: Loop: 8170#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8169#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8134#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8135#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8138#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8142#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8168#L16 [53] L16-->L34-2: Formula: (and (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_~i~0#1_15| 1)) (< (+ |v_ULTIMATE.start_main_~j~0#1_15| 2) |v_ULTIMATE.start_main_~i~0#1_15|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8170#L34-2 [2023-02-13 03:41:08,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash 777646664, now seen corresponding path program 1 times [2023-02-13 03:41:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:08,531 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198106109] [2023-02-13 03:41:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:08,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:08,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1143582560, now seen corresponding path program 1 times [2023-02-13 03:41:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:08,538 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096523674] [2023-02-13 03:41:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:08,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:08,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash 322670713, now seen corresponding path program 1 times [2023-02-13 03:41:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:08,543 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302151613] [2023-02-13 03:41:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:08,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:08,577 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302151613] [2023-02-13 03:41:08,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302151613] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:08,578 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057726147] [2023-02-13 03:41:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:08,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:08,578 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:08,579 INFO L229 MonitoredProcess]: Starting monitored process 26 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:08,580 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-13 03:41:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:08,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:08,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057726147] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:08,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:08,668 ERROR L197 FreeRefinementEngine]: {8212#true} [8214#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0), 8214#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0), 8215#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~i~0#1|), 8216#(<= 6 |ULTIMATE.start_main_~i~0#1|), 8216#(<= 6 |ULTIMATE.start_main_~i~0#1|), 8217#(<= 7 |ULTIMATE.start_main_~i~0#1|), 8217#(<= 7 |ULTIMATE.start_main_~i~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8213#false] {8213#false} [2023-02-13 03:41:08,668 ERROR L197 FreeRefinementEngine]: {8212#true} [8212#true, 8212#true, 8212#true, 8232#(<= 4 |ULTIMATE.start_main_~j~0#1|), 8232#(<= 4 |ULTIMATE.start_main_~j~0#1|), 8232#(<= 4 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8213#false] {8213#false} [2023-02-13 03:41:08,669 ERROR L197 FreeRefinementEngine]: {8212#true} [8212#true, 8212#true, 8212#true, 8232#(<= 4 |ULTIMATE.start_main_~j~0#1|), 8232#(<= 4 |ULTIMATE.start_main_~j~0#1|), 8232#(<= 4 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8218#(<= 6 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8219#(<= 5 |ULTIMATE.start_main_~j~0#1|), 8213#false] {8213#false} [2023-02-13 03:41:08,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2023-02-13 03:41:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793000894] [2023-02-13 03:41:08,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:08,732 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:08,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:08,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:08,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:08,733 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:08,733 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:08,733 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:08,733 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:08,734 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2023-02-13 03:41:08,734 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:08,734 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:08,736 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:08,741 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:08,745 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:08,788 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:08,788 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:08,789 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:08,790 INFO L229 MonitoredProcess]: Starting monitored process 27 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:08,793 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-13 03:41:08,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:08,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:08,808 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:08,808 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:08,832 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-02-13 03:41:08,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:08,835 INFO L229 MonitoredProcess]: Starting monitored process 28 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:08,837 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-13 03:41:08,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:08,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:08,855 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:08,855 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:08,882 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:08,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:08,884 INFO L229 MonitoredProcess]: Starting monitored process 29 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:08,887 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-13 03:41:08,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:08,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:08,940 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-02-13 03:41:08,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:08,942 INFO L229 MonitoredProcess]: Starting monitored process 30 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:08,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:08,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:08,945 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-13 03:41:08,990 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:08,991 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=5, ULTIMATE.start_main_~i~0#1=6} Honda state: {ULTIMATE.start_main_~j~0#1=5, ULTIMATE.start_main_~i~0#1=6} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=2}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=1}] Lambdas: [1, 2, 1] Nus: [0, 0] [2023-02-13 03:41:09,006 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-02-13 03:41:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:09,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-13 03:41:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-13 03:41:09,009 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:09,132 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2023-02-13 03:41:09,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 108 transitions. [2023-02-13 03:41:09,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-02-13 03:41:09,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 76 states and 86 transitions. [2023-02-13 03:41:09,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2023-02-13 03:41:09,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2023-02-13 03:41:09,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 86 transitions. [2023-02-13 03:41:09,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:09,137 INFO L220 hiAutomatonCegarLoop]: Abstraction has 76 states and 86 transitions. [2023-02-13 03:41:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 86 transitions. [2023-02-13 03:41:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2023-02-13 03:41:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 57 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-02-13 03:41:09,142 INFO L242 hiAutomatonCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-02-13 03:41:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 03:41:09,144 INFO L426 stractBuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-02-13 03:41:09,145 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-13 03:41:09,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2023-02-13 03:41:09,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-02-13 03:41:09,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:09,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:09,147 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2023-02-13 03:41:09,147 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2023-02-13 03:41:09,147 INFO L733 eck$LassoCheckResult]: Stem: 8418#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 8419#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8433#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8434#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8429#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8430#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8453#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8454#L16 [53] L16-->L34-2: Formula: (and (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_~i~0#1_15| 1)) (< (+ |v_ULTIMATE.start_main_~j~0#1_15| 2) |v_ULTIMATE.start_main_~i~0#1_15|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8425#L34-2 [2023-02-13 03:41:09,148 INFO L735 eck$LassoCheckResult]: Loop: 8425#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8428#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8432#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8456#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8459#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8457#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8458#L16 [53] L16-->L34-2: Formula: (and (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_~i~0#1_15| 1)) (< (+ |v_ULTIMATE.start_main_~j~0#1_15| 2) |v_ULTIMATE.start_main_~i~0#1_15|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8425#L34-2 [2023-02-13 03:41:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:09,149 INFO L85 PathProgramCache]: Analyzing trace with hash 777646640, now seen corresponding path program 1 times [2023-02-13 03:41:09,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:09,149 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537483470] [2023-02-13 03:41:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:09,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:09,185 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537483470] [2023-02-13 03:41:09,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537483470] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:09,185 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849303217] [2023-02-13 03:41:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:09,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,187 INFO L229 MonitoredProcess]: Starting monitored process 31 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,192 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-02-13 03:41:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:09,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:09,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849303217] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:09,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:09,271 ERROR L197 FreeRefinementEngine]: {8475#true} [8477#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0), 8477#(= (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) 0), 8478#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)), 8480#(<= |ULTIMATE.start_main_~i~0#1| (+ 3 |ULTIMATE.start_main_~j~0#1|)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))] {8476#false} [2023-02-13 03:41:09,272 ERROR L197 FreeRefinementEngine]: {8475#true} [8484#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|), 8484#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|), 8478#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)), 8480#(<= |ULTIMATE.start_main_~i~0#1| (+ 3 |ULTIMATE.start_main_~j~0#1|)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))] {8476#false} [2023-02-13 03:41:09,272 ERROR L197 FreeRefinementEngine]: {8475#true} [8484#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|), 8484#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|), 8478#(<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)), 8480#(<= |ULTIMATE.start_main_~i~0#1| (+ 3 |ULTIMATE.start_main_~j~0#1|)), 8479#(<= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))] {8476#false} [2023-02-13 03:41:09,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-13 03:41:09,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255388146] [2023-02-13 03:41:09,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:09,273 INFO L738 eck$LassoCheckResult]: stem already infeasible [2023-02-13 03:41:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1143582560, now seen corresponding path program 2 times [2023-02-13 03:41:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:09,275 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835481819] [2023-02-13 03:41:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:09,321 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:09,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:09,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:09,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:09,322 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:09,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:09,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:09,322 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2023-02-13 03:41:09,322 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:09,323 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:09,323 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:09,329 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:09,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:09,360 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:09,360 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:09,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,360 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,362 INFO L229 MonitoredProcess]: Starting monitored process 32 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,364 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-13 03:41:09,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:09,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,394 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-02-13 03:41:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,396 INFO L229 MonitoredProcess]: Starting monitored process 33 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,398 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-13 03:41:09,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:09,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,435 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:09,436 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=5, ULTIMATE.start_main_~i~0#1=6} Honda state: {ULTIMATE.start_main_~j~0#1=5, ULTIMATE.start_main_~i~0#1=6} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=1}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=1}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=1}] Lambdas: [0, 0, 1] Nus: [1, 1] [2023-02-13 03:41:09,456 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-02-13 03:41:09,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,457 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,458 INFO L229 MonitoredProcess]: Starting monitored process 34 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,460 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-13 03:41:09,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:09,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,477 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:09,478 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_8=1} Honda state: {v_rep~unnamed0~0~true_8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:09,504 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-02-13 03:41:09,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,505 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,505 INFO L229 MonitoredProcess]: Starting monitored process 35 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,507 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-13 03:41:09,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:09,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,523 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:09,523 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_8=0} Honda state: {v_rep~unnamed0~0~false_8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:09,548 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:09,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 03:41:09,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-13 03:41:09,550 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. cyclomatic complexity: 11 Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:09,606 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2023-02-13 03:41:09,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. [2023-02-13 03:41:09,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-02-13 03:41:09,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 74 transitions. [2023-02-13 03:41:09,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-02-13 03:41:09,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2023-02-13 03:41:09,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 74 transitions. [2023-02-13 03:41:09,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:09,610 INFO L220 hiAutomatonCegarLoop]: Abstraction has 65 states and 74 transitions. [2023-02-13 03:41:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 74 transitions. [2023-02-13 03:41:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-02-13 03:41:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.15) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-02-13 03:41:09,614 INFO L242 hiAutomatonCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-02-13 03:41:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 03:41:09,617 INFO L426 stractBuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-02-13 03:41:09,617 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-13 03:41:09,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2023-02-13 03:41:09,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-02-13 03:41:09,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:09,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:09,620 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1] [2023-02-13 03:41:09,620 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2023-02-13 03:41:09,621 INFO L733 eck$LassoCheckResult]: Stem: 8593#ULTIMATE.startENTRY [82] ULTIMATE.startENTRY-->L34-2: Formula: (= |v_ULTIMATE.start_main_~i~0#1_20| |v_ULTIMATE.start_main_~j~0#1_22|) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_20|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_22|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_#t~nondet0#1] 8594#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8608#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8636#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8603#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8605#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8600#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8601#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8633#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8631#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8626#L16 [2023-02-13 03:41:09,621 INFO L735 eck$LassoCheckResult]: Loop: 8626#L16 [53] L16-->L34-2: Formula: (and (= |v_ULTIMATE.start_main_~i~0#1_14| (+ |v_ULTIMATE.start_main_~i~0#1_15| 1)) (< (+ |v_ULTIMATE.start_main_~j~0#1_15| 2) |v_ULTIMATE.start_main_~i~0#1_15|)) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_15|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8599#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8602#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8649#L14 [75] L14-->L34-2: Formula: (and (>= |v_ULTIMATE.start_main_~j~0#1_19| 5) (= |v_ULTIMATE.start_main_~j~0#1_18| (+ (- 1) |v_ULTIMATE.start_main_~j~0#1_19|))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_19|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8628#L34-2 [67] L34-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_10|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[] 8647#L12 [70] L12-->L14: Formula: (and (<= |v_ULTIMATE.start_main_~j~0#1_12| |v_ULTIMATE.start_main_~i~0#1_13|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_12|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8630#L14 [63] L14-->L16: Formula: (and (< |v_ULTIMATE.start_main_~j~0#1_14| 5) (= |v_ULTIMATE.start_main_~j~0#1_13| (+ |v_ULTIMATE.start_main_~j~0#1_14| 1))) InVars {ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_14|} OutVars{ULTIMATE.start_main_~j~0#1=|v_ULTIMATE.start_main_~j~0#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0#1] 8626#L16 [2023-02-13 03:41:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash -5515285, now seen corresponding path program 1 times [2023-02-13 03:41:09,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:09,623 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460709839] [2023-02-13 03:41:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:09,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash -774001592, now seen corresponding path program 3 times [2023-02-13 03:41:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:09,638 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868583287] [2023-02-13 03:41:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash -61540066, now seen corresponding path program 2 times [2023-02-13 03:41:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:09,645 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361796018] [2023-02-13 03:41:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,650 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:09,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:09,686 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:09,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:09,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:09,688 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:09,688 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:09,688 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,688 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:09,688 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:09,688 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Loop [2023-02-13 03:41:09,688 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:09,688 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:09,689 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:09,696 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:09,698 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:09,744 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:09,744 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:09,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,745 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,747 INFO L229 MonitoredProcess]: Starting monitored process 36 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,749 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-13 03:41:09,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:09,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,791 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:09,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,793 INFO L229 MonitoredProcess]: Starting monitored process 37 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,795 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-13 03:41:09,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:09,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,828 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:09,829 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=5, ULTIMATE.start_main_~i~0#1=8} Honda state: {ULTIMATE.start_main_~j~0#1=5, ULTIMATE.start_main_~i~0#1=8} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=3}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=0}] Lambdas: [14, 1, 0] Nus: [0, 1] [2023-02-13 03:41:09,866 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-13 03:41:09,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,867 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,868 INFO L229 MonitoredProcess]: Starting monitored process 38 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,870 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-13 03:41:09,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:09,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,890 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:09,890 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:09,921 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-13 03:41:09,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:09,921 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:09,922 INFO L229 MonitoredProcess]: Starting monitored process 39 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:09,924 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-13 03:41:09,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:09,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:09,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:09,942 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:09,968 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:10,028 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:10,029 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:10,029 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:10,029 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:10,030 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:10,030 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,030 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:10,030 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:10,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso [2023-02-13 03:41:10,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:10,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:10,033 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,036 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,051 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,133 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:10,133 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:10,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,134 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:10,135 INFO L229 MonitoredProcess]: Starting monitored process 40 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:10,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:10,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:10,139 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-13 03:41:10,154 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:10,154 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:10,180 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-02-13 03:41:10,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,180 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:10,181 INFO L229 MonitoredProcess]: Starting monitored process 41 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:10,183 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-13 03:41:10,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:10,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:10,225 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-02-13 03:41:10,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,226 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:10,227 INFO L229 MonitoredProcess]: Starting monitored process 42 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:10,229 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-13 03:41:10,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:10,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:10,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:10,276 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=5, ULTIMATE.start_main_~i~0#1=9} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=3}, {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~i~0#1=0}] Lambdas: [19, 1, 14] Nus: [0, 1] [2023-02-13 03:41:10,316 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:10,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:10,318 INFO L229 MonitoredProcess]: Starting monitored process 43 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:10,320 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-13 03:41:10,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:10,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:10,333 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:10,333 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:10,363 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:10,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,363 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:10,364 INFO L229 MonitoredProcess]: Starting monitored process 44 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:10,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:10,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:10,367 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-13 03:41:10,383 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:10,383 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:10,409 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:10,411 INFO L229 MonitoredProcess]: Starting monitored process 45 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:10,413 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-02-13 03:41:10,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:10,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:10,425 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:10,426 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:10,455 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:10,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,473 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,473 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,474 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:41:10 BasicIcfg [2023-02-13 03:41:10,483 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-13 03:41:10,483 INFO L158 Benchmark]: Toolchain (without parser) took 8374.25ms. Allocated memory was 2.1GB in the beginning and 2.6GB in the end (delta: 453.0MB). Free memory was 2.1GB in the beginning and 1.7GB in the end (delta: 387.0MB). Peak memory consumption was 840.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:10,483 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:10,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 105.53ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.1MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:10,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.66ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.5MB). Peak memory consumption was 16.8MB. Max. memory is 42.9GB. [2023-02-13 03:41:10,484 INFO L158 Benchmark]: Boogie Preprocessor took 9.02ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:10,484 INFO L158 Benchmark]: RCFGBuilder took 170.54ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:10,485 INFO L158 Benchmark]: BlockEncodingV2 took 40.67ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:10,485 INFO L158 Benchmark]: TraceAbstraction took 14.07ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:10,485 INFO L158 Benchmark]: BuchiAutomizer took 8013.93ms. Allocated memory was 2.1GB in the beginning and 2.6GB in the end (delta: 453.0MB). Free memory was 2.1GB in the beginning and 1.7GB in the end (delta: 354.2MB). Peak memory consumption was 806.8MB. Max. memory is 42.9GB. [2023-02-13 03:41:10,486 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 20 edges - StatisticsResult: Encoded RCFG 8 locations, 15 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. * CACSL2BoogieTranslator took 105.53ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.1MB). There was no memory consumed. Max. memory is 42.9GB. * Boogie Procedure Inliner took 15.66ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.5MB). Peak memory consumption was 16.8MB. Max. memory is 42.9GB. * Boogie Preprocessor took 9.02ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 42.9GB. * RCFGBuilder took 170.54ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * BlockEncodingV2 took 40.67ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * TraceAbstraction took 14.07ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 42.9GB. * BuchiAutomizer took 8013.93ms. Allocated memory was 2.1GB in the beginning and 2.6GB in the end (delta: 453.0MB). Free memory was 2.1GB in the beginning and 1.7GB in the end (delta: 354.2MB). Peak memory consumption was 806.8MB. Max. memory is 42.9GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (10 trivial, 0 deterministic, 3 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 7 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 7 and consists of 31 locations. 10 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 60 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 13 iterations. TraceHistogramMax:5. Analysis of lassos took 3.7s. Construction of modules took 0.5s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 856 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14/16 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1040 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 243 mSolverCounterUnsat, 41 mSDtfsCounter, 1040 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT2 conc1 concLT1 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax150 hnf100 lsp66 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp87 dnf100 smp100 tf106 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 16]: Nontermination argument in form of an infinite program execution. [2023-02-13 03:41:10,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2023-02-13 03:41:10,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2023-02-13 03:41:10,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false Nontermination argument in form of an infinite execution State at position 0 is {j=0, i=0, ~unnamed0~0~true=1, ~unnamed0~0~false=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@256998dd=0, \result=0} State at position 1 is {j=5, i=9, ~unnamed0~0~true=1, ~unnamed0~0~false=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@256998dd=0, \result=0} For i>1, the state at position i is {j=5 + sum_{k=0}^i 0, i=9 + sum_{k=0}^i 3, ~unnamed0~0~true=1 + sum_{k=0}^i 0, ~unnamed0~0~false=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@256998dd=0 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 1GEVs Lambdas: [19, 1, 14] Mus: [0, 1] - NonterminatingLassoResult [Line: 16]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] i = __VERIFIER_nondet_int() [L9] j = i [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND TRUE j < 5 [L15] j = j+1 Loop: [L16] COND TRUE i-j>2 [L17] i = i+1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND TRUE j < 5 [L15] j = j+1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-13 03:41:10,530 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-02-13 03:41:10,735 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-02-13 03:41:10,930 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-13 03:41:11,135 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-02-13 03:41:11,332 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-02-13 03:41:11,542 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-13 03:41:11,747 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-13 03:41:11,934 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Ended with exit code 0 Received shutdown request...