./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:57:06,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:57:06,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:57:06,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:57:06,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:57:06,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:57:06,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:57:06,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:57:06,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:57:06,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:57:06,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:57:06,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:57:06,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:57:06,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:57:06,109 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:57:06,109 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:57:06,109 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:57:06,109 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:57:06,109 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:57:06,109 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:57:06,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:57:06,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:57:06,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:57:06,110 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:57:06,110 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 [2025-03-17 19:57:06,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:57:06,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:57:06,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:57:06,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:57:06,334 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:57:06,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2025-03-17 19:57:07,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1d42e24/fe59451657104eb4b1340c66b82f99b9/FLAG088e31b73 [2025-03-17 19:57:07,754 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:57:07,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2025-03-17 19:57:07,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1d42e24/fe59451657104eb4b1340c66b82f99b9/FLAG088e31b73 [2025-03-17 19:57:08,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1d42e24/fe59451657104eb4b1340c66b82f99b9 [2025-03-17 19:57:08,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:57:08,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:57:08,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:57:08,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:57:08,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:57:08,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30296b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08, skipping insertion in model container [2025-03-17 19:57:08,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:57:08,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:57:08,332 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:57:08,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:57:08,386 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:57:08,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08 WrapperNode [2025-03-17 19:57:08,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:57:08,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:57:08,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:57:08,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:57:08,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,419 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2025-03-17 19:57:08,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:57:08,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:57:08,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:57:08,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:57:08,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,445 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [7, 2, 2]. 64 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 4 writes are split as follows [2, 0, 2]. [2025-03-17 19:57:08,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:57:08,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:57:08,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:57:08,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:57:08,463 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (1/1) ... [2025-03-17 19:57:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:08,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:08,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:57:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:57:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:57:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:57:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:57:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:57:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:57:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:57:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:57:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:57:08,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:57:08,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:57:08,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:57:08,753 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: havoc main_#t~ret18#1;call ULTIMATE.dealloc(main_#t~malloc17#1.base, main_#t~malloc17#1.offset);havoc main_#t~malloc17#1.base, main_#t~malloc17#1.offset; [2025-03-17 19:57:08,753 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: call ULTIMATE.dealloc(lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset);havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call ULTIMATE.dealloc(lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset);havoc lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset; [2025-03-17 19:57:08,763 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 19:57:08,764 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:57:08,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:57:08,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:57:08,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:57:08 BoogieIcfgContainer [2025-03-17 19:57:08,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:57:08,774 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:57:08,774 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:57:08,777 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:57:08,778 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:57:08,778 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:57:08" (1/3) ... [2025-03-17 19:57:08,778 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21e05121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:57:08, skipping insertion in model container [2025-03-17 19:57:08,778 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:57:08,778 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:08" (2/3) ... [2025-03-17 19:57:08,779 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21e05121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:57:08, skipping insertion in model container [2025-03-17 19:57:08,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:57:08,779 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:57:08" (3/3) ... [2025-03-17 19:57:08,779 INFO L363 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2025-03-17 19:57:08,810 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:57:08,811 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:57:08,811 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:57:08,811 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:57:08,811 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:57:08,811 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:57:08,812 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:57:08,812 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:57:08,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) [2025-03-17 19:57:08,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-03-17 19:57:08,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:08,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:08,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:57:08,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:57:08,828 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:57:08,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) [2025-03-17 19:57:08,829 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-03-17 19:57:08,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:08,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:08,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:57:08,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:57:08,832 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" [2025-03-17 19:57:08,833 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-03-17 19:57:08,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 54582, now seen corresponding path program 1 times [2025-03-17 19:57:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:08,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357397192] [2025-03-17 19:57:08,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:08,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:08,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:08,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:08,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:08,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:08,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:08,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:08,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:08,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:08,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 1 times [2025-03-17 19:57:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943777821] [2025-03-17 19:57:08,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:08,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:57:08,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:57:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:08,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:08,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:57:08,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:57:08,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:08,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:08,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:08,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1692063, now seen corresponding path program 1 times [2025-03-17 19:57:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:08,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946627601] [2025-03-17 19:57:08,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:09,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:09,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:09,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:09,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:09,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:09,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:09,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:09,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:09,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:09,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:09,615 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:09,616 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:09,616 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:09,617 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:09,617 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:09,617 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:09,617 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:09,617 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:09,617 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2025-03-17 19:57:09,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:09,618 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:09,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,316 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:10,319 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:10,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:57:10,325 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 [2025-03-17 19:57:10,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:57:10,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:57:10,355 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 [2025-03-17 19:57:10,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 19:57:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:57:10,377 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 [2025-03-17 19:57:10,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 19:57:10,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:57:10,403 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 [2025-03-17 19:57:10,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:57:10,428 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 [2025-03-17 19:57:10,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:57:10,453 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 [2025-03-17 19:57:10,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 19:57:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,474 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:57:10,477 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 [2025-03-17 19:57:10,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:57:10,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,500 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:57:10,502 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 [2025-03-17 19:57:10,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:57:10,528 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 [2025-03-17 19:57:10,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 19:57:10,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,550 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:57:10,553 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 [2025-03-17 19:57:10,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,575 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:57:10,578 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 [2025-03-17 19:57:10,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,603 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:57:10,606 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 [2025-03-17 19:57:10,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,630 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:57:10,632 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 [2025-03-17 19:57:10,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:57:10,656 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 [2025-03-17 19:57:10,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,679 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,682 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 [2025-03-17 19:57:10,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:57:10,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:57:10,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:57:10,704 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 [2025-03-17 19:57:10,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:57:10,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,728 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:57:10,731 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 [2025-03-17 19:57:10,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,758 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:57:10,762 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 [2025-03-17 19:57:10,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,782 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:57:10,784 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 [2025-03-17 19:57:10,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:57:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,802 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:57:10,804 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 [2025-03-17 19:57:10,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 19:57:10,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,823 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:57:10,825 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 [2025-03-17 19:57:10,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:57:10,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,863 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:57:10,864 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 [2025-03-17 19:57:10,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:57:10,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,886 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:57:10,888 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 [2025-03-17 19:57:10,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:57:10,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,914 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:10,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:57:10,916 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 [2025-03-17 19:57:10,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:10,997 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 19:57:10,999 INFO L444 ModelExtractionUtils]: 8 out of 31 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-03-17 19:57:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:11,002 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:11,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:57:11,005 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:11,016 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:57:11,018 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:11,018 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2025-03-17 19:57:11,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 19:57:11,060 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2025-03-17 19:57:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:11,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:11,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:57:11,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:57:11,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:11,142 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 19:57:11,144 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Second operand has 2 states, 2 states have (on average 2.0) 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) [2025-03-17 19:57:11,163 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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). Second operand has 2 states, 2 states have (on average 2.0) 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 18 states and 27 transitions. Complement of second has 3 states. [2025-03-17 19:57:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:57:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) 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) [2025-03-17 19:57:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-03-17 19:57:11,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-17 19:57:11,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 19:57:11,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 19:57:11,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 27 transitions. [2025-03-17 19:57:11,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 19:57:11,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 23 transitions. [2025-03-17 19:57:11,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 19:57:11,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 19:57:11,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2025-03-17 19:57:11,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:57:11,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-03-17 19:57:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2025-03-17 19:57:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-17 19:57:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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) [2025-03-17 19:57:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2025-03-17 19:57:11,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 21 transitions. [2025-03-17 19:57:11,191 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2025-03-17 19:57:11,191 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:57:11,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2025-03-17 19:57:11,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 19:57:11,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:11,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:11,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:57:11,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:57:11,192 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" [2025-03-17 19:57:11,192 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:11,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1692062, now seen corresponding path program 1 times [2025-03-17 19:57:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-03-17 19:57:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:11,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:11,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:11,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:11,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-03-17 19:57:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189421260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:57:11,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:57:11,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:57:11,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730767718] [2025-03-17 19:57:11,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:57:11,290 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1562, now seen corresponding path program 1 times [2025-03-17 19:57:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393914616] [2025-03-17 19:57:11,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:11,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:11,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:11,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:11,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:11,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:11,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:11,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:11,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:11,321 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:11,321 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:11,321 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:11,321 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:11,321 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:57:11,322 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:11,322 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:11,322 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:11,322 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2025-03-17 19:57:11,322 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:11,322 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:11,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,386 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:11,386 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:57:11,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:11,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:11,390 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:57:11,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:57:11,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:57:11,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:57:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:11,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:11,420 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:11,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:57:11,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:57:11,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:57:11,446 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:57:11,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 19:57:11,451 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:11,451 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:11,451 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:11,451 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:11,451 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:11,451 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:11,451 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:11,451 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:11,451 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2025-03-17 19:57:11,451 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:11,451 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:11,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:11,511 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:11,511 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:11,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:11,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:11,513 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:11,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:57:11,515 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 [2025-03-17 19:57:11,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:11,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:11,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:11,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:11,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:11,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:11,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:11,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:11,530 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:57:11,530 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:57:11,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:11,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:11,532 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:11,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 19:57:11,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:11,537 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:57:11,537 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:11,537 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2025-03-17 19:57:11,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:11,543 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:57:11,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:11,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:11,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:11,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:11,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:11,599 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:57:11,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 21 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-17 19:57:11,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 21 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 30 states and 50 transitions. Complement of second has 7 states. [2025-03-17 19:57:11,635 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 [2025-03-17 19:57:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-17 19:57:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-17 19:57:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:57:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-17 19:57:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-17 19:57:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 50 transitions. [2025-03-17 19:57:11,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:57:11,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 50 transitions. [2025-03-17 19:57:11,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-17 19:57:11,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 19:57:11,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 50 transitions. [2025-03-17 19:57:11,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:11,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 50 transitions. [2025-03-17 19:57:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 50 transitions. [2025-03-17 19:57:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-03-17 19:57:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 states have internal predecessors, (38), 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) [2025-03-17 19:57:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2025-03-17 19:57:11,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 38 transitions. [2025-03-17 19:57:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:11,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:57:11,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:57:11,641 INFO L87 Difference]: Start difference. First operand 22 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2025-03-17 19:57:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:11,664 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. [2025-03-17 19:57:11,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 37 transitions. [2025-03-17 19:57:11,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 19:57:11,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 37 transitions. [2025-03-17 19:57:11,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-17 19:57:11,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-17 19:57:11,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 37 transitions. [2025-03-17 19:57:11,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:11,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 37 transitions. [2025-03-17 19:57:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 37 transitions. [2025-03-17 19:57:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-17 19:57:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 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) [2025-03-17 19:57:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2025-03-17 19:57:11,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 37 transitions. [2025-03-17 19:57:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:57:11,672 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 37 transitions. [2025-03-17 19:57:11,672 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:57:11,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 37 transitions. [2025-03-17 19:57:11,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 19:57:11,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:11,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:11,673 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:11,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:11,673 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:11,673 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:11,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1626073182, now seen corresponding path program 1 times [2025-03-17 19:57:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:11,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783432120] [2025-03-17 19:57:11,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:11,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:11,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:11,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783432120] [2025-03-17 19:57:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783432120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912914822] [2025-03-17 19:57:11,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:11,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:11,771 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:11,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-17 19:57:11,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:11,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:11,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:11,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912914822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:11,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:11,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 19:57:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693545338] [2025-03-17 19:57:11,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:11,856 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:11,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 1 times [2025-03-17 19:57:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:11,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309327634] [2025-03-17 19:57:11,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:11,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:11,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:11,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:11,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:11,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:11,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:11,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:12,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:57:12,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:57:12,142 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. cyclomatic complexity: 19 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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) [2025-03-17 19:57:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:12,210 INFO L93 Difference]: Finished difference Result 40 states and 65 transitions. [2025-03-17 19:57:12,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 65 transitions. [2025-03-17 19:57:12,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 19:57:12,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 65 transitions. [2025-03-17 19:57:12,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 19:57:12,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 19:57:12,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 65 transitions. [2025-03-17 19:57:12,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:12,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 65 transitions. [2025-03-17 19:57:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 65 transitions. [2025-03-17 19:57:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 24. [2025-03-17 19:57:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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) [2025-03-17 19:57:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2025-03-17 19:57:12,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 40 transitions. [2025-03-17 19:57:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:57:12,214 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 40 transitions. [2025-03-17 19:57:12,214 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:57:12,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 40 transitions. [2025-03-17 19:57:12,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 19:57:12,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:12,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:12,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:12,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:57:12,219 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 0;" [2025-03-17 19:57:12,219 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call lis_#t~mem13#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);" "assume lis_~max~0#1 < lis_#t~mem13#1;havoc lis_#t~mem13#1;call lis_#t~mem14#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem14#1;" "lis_#t~post15#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post15#1;havoc lis_#t~post15#1;" [2025-03-17 19:57:12,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1626073174, now seen corresponding path program 1 times [2025-03-17 19:57:12,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:12,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443360164] [2025-03-17 19:57:12,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:12,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:12,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:12,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:12,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:12,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:12,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:12,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:12,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:12,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:12,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:12,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 1 times [2025-03-17 19:57:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-17 19:57:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:12,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:12,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:12,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:12,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:12,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:12,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:12,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:12,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:12,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:12,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:12,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -590195085, now seen corresponding path program 1 times [2025-03-17 19:57:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126594274] [2025-03-17 19:57:12,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:12,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:57:12,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:57:12,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:12,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:12,287 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:12,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:57:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:57:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:12,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:12,732 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:12,732 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:12,732 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:12,732 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:12,732 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:12,732 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:12,733 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:12,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:12,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration4_Lasso [2025-03-17 19:57:12,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:12,733 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:12,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:12,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:13,192 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:13,192 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,234 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:57:13,236 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 [2025-03-17 19:57:13,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:13,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:13,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:13,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:57:13,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,254 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:57:13,257 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 [2025-03-17 19:57:13,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:13,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:13,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:13,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 19:57:13,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,275 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:57:13,291 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 [2025-03-17 19:57:13,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:13,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:13,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:13,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:13,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:13,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 19:57:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,311 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:57:13,315 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 [2025-03-17 19:57:13,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:13,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:13,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:13,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 19:57:13,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,333 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 19:57:13,334 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 [2025-03-17 19:57:13,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:13,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:13,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:13,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 19:57:13,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,353 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 19:57:13,355 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 [2025-03-17 19:57:13,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:13,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:13,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:13,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 19:57:13,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,374 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 19:57:13,376 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 [2025-03-17 19:57:13,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 19:57:13,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,410 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 19:57:13,412 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 [2025-03-17 19:57:13,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 19:57:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,436 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 19:57:13,439 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 [2025-03-17 19:57:13,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,463 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 19:57:13,466 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 [2025-03-17 19:57:13,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:13,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,488 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 19:57:13,490 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 [2025-03-17 19:57:13,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:13,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,512 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 19:57:13,515 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 [2025-03-17 19:57:13,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 19:57:13,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,536 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 19:57:13,538 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 [2025-03-17 19:57:13,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 19:57:13,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,564 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:57:13,565 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 [2025-03-17 19:57:13,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 19:57:13,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,586 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 19:57:13,588 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 [2025-03-17 19:57:13,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:13,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,609 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 19:57:13,612 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 [2025-03-17 19:57:13,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:13,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:13,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,635 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 19:57:13,638 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 [2025-03-17 19:57:13,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:13,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:13,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:13,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:13,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:13,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:13,658 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:13,669 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 19:57:13,670 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:57:13,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:13,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,672 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 19:57:13,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:13,686 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:57:13,686 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:13,686 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1, ULTIMATE.start_lis_~N#1) = -1*ULTIMATE.start_lis_~i~0#1 + 1*ULTIMATE.start_lis_~N#1 Supporting invariants [] [2025-03-17 19:57:13,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 19:57:13,713 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 19:57:13,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:13,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:57:13,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:13,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:13,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:13,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:13,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:57:13,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:13,765 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:57:13,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 40 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-17 19:57:13,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 40 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 27 states and 45 transitions. Complement of second has 4 states. [2025-03-17 19:57:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:57:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-17 19:57:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-03-17 19:57:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-17 19:57:13,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-17 19:57:13,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-17 19:57:13,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:13,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 45 transitions. [2025-03-17 19:57:13,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:57:13,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 31 transitions. [2025-03-17 19:57:13,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 19:57:13,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 19:57:13,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2025-03-17 19:57:13,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:13,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2025-03-17 19:57:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2025-03-17 19:57:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-17 19:57:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 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) [2025-03-17 19:57:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2025-03-17 19:57:13,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2025-03-17 19:57:13,787 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2025-03-17 19:57:13,787 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:57:13,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2025-03-17 19:57:13,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:57:13,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:13,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:13,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-03-17 19:57:13,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:13,788 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:13,788 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:13,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1131337899, now seen corresponding path program 2 times [2025-03-17 19:57:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286084726] [2025-03-17 19:57:13,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:13,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-17 19:57:13,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:13,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:13,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:13,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:13,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:13,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 2 times [2025-03-17 19:57:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851035669] [2025-03-17 19:57:13,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:13,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:57:13,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:13,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:13,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:13,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:13,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:13,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash 250140249, now seen corresponding path program 1 times [2025-03-17 19:57:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:13,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506395107] [2025-03-17 19:57:13,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:13,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:13,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:13,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:57:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506395107] [2025-03-17 19:57:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506395107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968548857] [2025-03-17 19:57:13,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:13,976 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:13,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-03-17 19:57:14,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:14,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:14,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:14,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:14,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:57:14,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:57:14,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:57:14,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968548857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:14,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:14,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 19:57:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727902628] [2025-03-17 19:57:14,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:14,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:57:14,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:57:14,312 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 14 Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 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) [2025-03-17 19:57:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:14,357 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2025-03-17 19:57:14,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 90 transitions. [2025-03-17 19:57:14,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-17 19:57:14,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 50 states and 79 transitions. [2025-03-17 19:57:14,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-17 19:57:14,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-17 19:57:14,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 79 transitions. [2025-03-17 19:57:14,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:14,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 79 transitions. [2025-03-17 19:57:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 79 transitions. [2025-03-17 19:57:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2025-03-17 19:57:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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) [2025-03-17 19:57:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2025-03-17 19:57:14,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2025-03-17 19:57:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:57:14,362 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2025-03-17 19:57:14,362 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:57:14,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2025-03-17 19:57:14,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:57:14,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:14,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:14,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-03-17 19:57:14,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:57:14,363 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:14,363 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" [2025-03-17 19:57:14,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1131337899, now seen corresponding path program 3 times [2025-03-17 19:57:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578679955] [2025-03-17 19:57:14,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:57:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:14,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 2 equivalence classes. [2025-03-17 19:57:14,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:14,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:57:14,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:14,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:14,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:14,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:14,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1475582, now seen corresponding path program 1 times [2025-03-17 19:57:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:14,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387036886] [2025-03-17 19:57:14,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:14,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:14,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:14,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:14,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:14,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:14,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:14,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:14,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash 911991122, now seen corresponding path program 1 times [2025-03-17 19:57:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:14,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134580648] [2025-03-17 19:57:14,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:14,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:57:14,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:57:14,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:14,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:57:14,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:57:14,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:14,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:15,156 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:15,156 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:15,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:15,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:15,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:15,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:15,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:15,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:15,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration6_Lasso [2025-03-17 19:57:15,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:15,159 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:15,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:15,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:15,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:16,196 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:16,196 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,201 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 19:57:16,203 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 [2025-03-17 19:57:16,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:16,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:16,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:16,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 19:57:16,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,222 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 19:57:16,223 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 [2025-03-17 19:57:16,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:16,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:16,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:16,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 19:57:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,243 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 19:57:16,244 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 [2025-03-17 19:57:16,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:16,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:16,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:16,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 19:57:16,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,263 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 19:57:16,265 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 [2025-03-17 19:57:16,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:16,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:16,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 19:57:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,285 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 19:57:16,287 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 [2025-03-17 19:57:16,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:16,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:16,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:16,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-17 19:57:16,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,306 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 19:57:16,308 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 [2025-03-17 19:57:16,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:16,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:16,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:16,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,327 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 19:57:16,329 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 [2025-03-17 19:57:16,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:16,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:16,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:16,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:16,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,347 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 19:57:16,349 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 [2025-03-17 19:57:16,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:16,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:16,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 19:57:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,369 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 19:57:16,371 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 [2025-03-17 19:57:16,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:16,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:16,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:16,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 19:57:16,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,392 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 19:57:16,393 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 [2025-03-17 19:57:16,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:16,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:16,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:16,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:16,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:16,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:16,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:16,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:16,408 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:57:16,408 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:57:16,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:16,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,410 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 19:57:16,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:16,412 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:57:16,412 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:16,412 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~a#1.base) (+ ULTIMATE.start_lis_~a#1.offset (* ULTIMATE.start_lis_~j~0#1 4)))_1, v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~a#1.base) (+ ULTIMATE.start_lis_~a#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_1) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~a#1.base) (+ ULTIMATE.start_lis_~a#1.offset (* ULTIMATE.start_lis_~j~0#1 4)))_1 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~a#1.base) (+ ULTIMATE.start_lis_~a#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_1 Supporting invariants [] [2025-03-17 19:57:16,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:16,496 INFO L156 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2025-03-17 19:57:16,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 19:57:16,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 19:57:16,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-17 19:57:16,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 19:57:16,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 19:57:16,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-17 19:57:16,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-17 19:57:16,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:16,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:16,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:16,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:16,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:57:16,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:16,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:16,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:16,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:57:16,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:16,711 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-03-17 19:57:16,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 18 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-17 19:57:16,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 18. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 63 states and 98 transitions. Complement of second has 11 states. [2025-03-17 19:57:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 19:57:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-17 19:57:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2025-03-17 19:57:16,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 19:57:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:16,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 19:57:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:16,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2025-03-17 19:57:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:16,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 98 transitions. [2025-03-17 19:57:16,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:57:16,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 54 states and 83 transitions. [2025-03-17 19:57:16,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 19:57:16,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 19:57:16,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 83 transitions. [2025-03-17 19:57:16,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:16,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 83 transitions. [2025-03-17 19:57:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 83 transitions. [2025-03-17 19:57:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-17 19:57:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.58) internal successors, (79), 49 states have internal predecessors, (79), 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) [2025-03-17 19:57:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2025-03-17 19:57:16,781 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 79 transitions. [2025-03-17 19:57:16,781 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 79 transitions. [2025-03-17 19:57:16,781 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:57:16,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 79 transitions. [2025-03-17 19:57:16,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-17 19:57:16,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:16,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:16,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:16,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:57:16,784 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" [2025-03-17 19:57:16,784 INFO L754 eck$LassoCheckResult]: Loop: "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" [2025-03-17 19:57:16,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1078959557, now seen corresponding path program 1 times [2025-03-17 19:57:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:16,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-03-17 19:57:16,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:16,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:57:16,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:16,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:16,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:16,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:16,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:57:16,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:16,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:16,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:16,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:16,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:16,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1328612, now seen corresponding path program 2 times [2025-03-17 19:57:16,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:16,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760554235] [2025-03-17 19:57:16,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:16,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:16,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:16,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:57:16,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:16,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:16,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:16,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:16,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:16,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:16,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:16,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:16,824 INFO L85 PathProgramCache]: Analyzing trace with hash -806028514, now seen corresponding path program 1 times [2025-03-17 19:57:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252174117] [2025-03-17 19:57:16,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:16,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:57:16,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:16,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:16,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:57:16,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:16,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252174117] [2025-03-17 19:57:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252174117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:16,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438235071] [2025-03-17 19:57:16,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:16,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:16,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:16,899 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:16,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-17 19:57:16,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:57:16,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:16,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:16,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:16,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:57:16,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:57:16,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:57:16,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438235071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:57:16,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:57:16,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-17 19:57:16,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841870572] [2025-03-17 19:57:16,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:57:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:17,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:57:17,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:57:17,165 INFO L87 Difference]: Start difference. First operand 50 states and 79 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2025-03-17 19:57:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:17,190 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2025-03-17 19:57:17,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 72 transitions. [2025-03-17 19:57:17,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:57:17,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 41 states and 59 transitions. [2025-03-17 19:57:17,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 19:57:17,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-17 19:57:17,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2025-03-17 19:57:17,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:17,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 19:57:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2025-03-17 19:57:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-03-17 19:57:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 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) [2025-03-17 19:57:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2025-03-17 19:57:17,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 55 transitions. [2025-03-17 19:57:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:57:17,194 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2025-03-17 19:57:17,194 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:57:17,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2025-03-17 19:57:17,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:57:17,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:17,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:17,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-17 19:57:17,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:17,195 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:17,195 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:17,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1078005435, now seen corresponding path program 1 times [2025-03-17 19:57:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852471340] [2025-03-17 19:57:17,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:17,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:57:17,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:17,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:17,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:57:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852471340] [2025-03-17 19:57:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852471340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:57:17,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:57:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:57:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303162012] [2025-03-17 19:57:17,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:57:17,233 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 3 times [2025-03-17 19:57:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443883891] [2025-03-17 19:57:17,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:57:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:17,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:57:17,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:17,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:57:17,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:17,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:17,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:17,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:17,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:17,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:17,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:57:17,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:57:17,468 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) [2025-03-17 19:57:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:17,485 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2025-03-17 19:57:17,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2025-03-17 19:57:17,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:57:17,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 54 transitions. [2025-03-17 19:57:17,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 19:57:17,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 19:57:17,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 54 transitions. [2025-03-17 19:57:17,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:17,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-03-17 19:57:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 54 transitions. [2025-03-17 19:57:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 19:57:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 36 states have internal predecessors, (54), 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) [2025-03-17 19:57:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2025-03-17 19:57:17,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-03-17 19:57:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:57:17,489 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-03-17 19:57:17,489 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:57:17,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 54 transitions. [2025-03-17 19:57:17,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:57:17,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:17,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:17,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:17,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:17,489 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:17,489 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1383975310, now seen corresponding path program 1 times [2025-03-17 19:57:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376175175] [2025-03-17 19:57:17,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:17,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:17,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:17,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:17,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376175175] [2025-03-17 19:57:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376175175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779138616] [2025-03-17 19:57:17,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:17,965 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:17,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-03-17 19:57:18,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:18,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:18,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:18,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:18,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 19:57:18,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:18,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:57:18,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 19:57:18,115 INFO L349 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2025-03-17 19:57:18,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 23 [2025-03-17 19:57:18,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:18,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2025-03-17 19:57:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:18,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:20,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2025-03-17 19:57:21,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:21,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6730 treesize of output 6346 [2025-03-17 19:57:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:21,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779138616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:21,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:21,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-17 19:57:21,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335670058] [2025-03-17 19:57:21,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:21,130 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:21,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571453, now seen corresponding path program 4 times [2025-03-17 19:57:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-03-17 19:57:21,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:57:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:21,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:57:21,139 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:21,139 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:57:21,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:21,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:21,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:21,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:21,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:21,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:57:21,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:57:21,351 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. cyclomatic complexity: 20 Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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) [2025-03-17 19:57:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:21,577 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2025-03-17 19:57:21,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 77 transitions. [2025-03-17 19:57:21,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:57:21,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 77 transitions. [2025-03-17 19:57:21,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 19:57:21,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 19:57:21,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 77 transitions. [2025-03-17 19:57:21,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:21,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 77 transitions. [2025-03-17 19:57:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 77 transitions. [2025-03-17 19:57:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2025-03-17 19:57:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 34 states have internal predecessors, (50), 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) [2025-03-17 19:57:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2025-03-17 19:57:21,583 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2025-03-17 19:57:21,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:57:21,584 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2025-03-17 19:57:21,584 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:57:21,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2025-03-17 19:57:21,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:57:21,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:21,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:21,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:21,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:21,585 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:21,585 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:21,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1383946480, now seen corresponding path program 1 times [2025-03-17 19:57:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054311947] [2025-03-17 19:57:21,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:21,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:21,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:21,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:21,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:57:21,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054311947] [2025-03-17 19:57:21,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054311947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:57:21,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:57:21,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:57:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729890745] [2025-03-17 19:57:21,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:57:21,613 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:21,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571453, now seen corresponding path program 5 times [2025-03-17 19:57:21,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:21,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822197414] [2025-03-17 19:57:21,613 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:57:21,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:21,616 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:57:21,622 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:21,622 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:21,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:21,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:21,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:21,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:21,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:21,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:21,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:57:21,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:57:21,846 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2025-03-17 19:57:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:21,855 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2025-03-17 19:57:21,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2025-03-17 19:57:21,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:57:21,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 37 states and 50 transitions. [2025-03-17 19:57:21,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 19:57:21,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 19:57:21,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2025-03-17 19:57:21,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:21,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-17 19:57:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2025-03-17 19:57:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 19:57:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 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) [2025-03-17 19:57:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-03-17 19:57:21,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-17 19:57:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:57:21,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-17 19:57:21,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:57:21,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2025-03-17 19:57:21,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:57:21,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:21,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:21,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:21,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:21,861 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:21,861 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:21,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:21,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1383976271, now seen corresponding path program 2 times [2025-03-17 19:57:21,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:21,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776154732] [2025-03-17 19:57:21,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:21,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:21,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:57:21,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:21,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:21,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:21,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:21,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:21,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:21,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571453, now seen corresponding path program 6 times [2025-03-17 19:57:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380826140] [2025-03-17 19:57:21,904 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:57:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:21,910 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:57:21,912 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:21,912 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 19:57:21,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:21,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:21,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:21,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:21,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:21,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1338711827, now seen corresponding path program 3 times [2025-03-17 19:57:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:21,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595825607] [2025-03-17 19:57:21,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:57:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:21,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-17 19:57:21,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 19 statements. [2025-03-17 19:57:21,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:57:21,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:57:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595825607] [2025-03-17 19:57:21,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595825607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247230793] [2025-03-17 19:57:21,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:57:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:21,982 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:21,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-03-17 19:57:22,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-17 19:57:22,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 19 statements. [2025-03-17 19:57:22,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:57:22,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:22,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:57:22,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:57:22,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:57:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247230793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:22,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 19:57:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294079129] [2025-03-17 19:57:22,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:22,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:22,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:57:22,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:57:22,340 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. cyclomatic complexity: 16 Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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) [2025-03-17 19:57:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:22,391 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2025-03-17 19:57:22,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 73 transitions. [2025-03-17 19:57:22,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-03-17 19:57:22,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 31 states and 41 transitions. [2025-03-17 19:57:22,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-17 19:57:22,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-17 19:57:22,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2025-03-17 19:57:22,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:22,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-17 19:57:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2025-03-17 19:57:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-17 19:57:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 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) [2025-03-17 19:57:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-17 19:57:22,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-17 19:57:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:57:22,394 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-17 19:57:22,394 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:57:22,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2025-03-17 19:57:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:57:22,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:22,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:22,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:22,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2025-03-17 19:57:22,395 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:22,395 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:22,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1383976271, now seen corresponding path program 4 times [2025-03-17 19:57:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:22,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553189965] [2025-03-17 19:57:22,396 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:57:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:22,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:57:22,430 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:22,431 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:57:22,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:22,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:22,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:22,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1660545824, now seen corresponding path program 7 times [2025-03-17 19:57:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:22,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715870707] [2025-03-17 19:57:22,445 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:57:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:22,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:57:22,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:22,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:22,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:57:22,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:22,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash -668161136, now seen corresponding path program 5 times [2025-03-17 19:57:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394531130] [2025-03-17 19:57:22,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:57:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:22,468 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-17 19:57:22,490 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:57:22,490 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 19:57:22,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:22,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:57:22,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:57:22,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:24,853 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:24,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:24,854 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:24,854 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:24,854 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:24,854 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,854 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:24,854 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:24,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration12_Lasso [2025-03-17 19:57:24,854 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:24,854 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:24,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:25,877 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:25,877 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:25,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:25,906 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:25,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 19:57:25,907 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 [2025-03-17 19:57:25,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:25,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:25,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:25,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:25,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:25,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:25,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:25,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:25,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 19:57:25,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:25,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:25,926 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:25,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 19:57:25,928 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 [2025-03-17 19:57:25,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:25,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:25,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:25,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:25,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:25,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:25,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:25,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:25,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-17 19:57:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:25,946 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:25,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 19:57:25,948 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 [2025-03-17 19:57:25,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:25,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:25,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:25,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:25,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:25,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:25,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:25,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:25,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 19:57:25,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:25,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:25,967 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:25,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 19:57:25,968 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 [2025-03-17 19:57:25,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:25,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:25,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:25,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:25,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:25,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:25,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:25,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:25,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 19:57:25,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:25,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:25,987 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:25,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 19:57:25,989 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 [2025-03-17 19:57:26,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:26,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:26,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:26,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:26,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:26,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:26,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:26,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:26,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-17 19:57:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:26,011 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:26,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 19:57:26,014 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 [2025-03-17 19:57:26,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:26,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:26,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:26,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:26,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:26,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:26,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:26,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:26,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:26,035 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:26,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 19:57:26,038 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 [2025-03-17 19:57:26,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:26,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:26,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:26,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:26,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:26,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:26,054 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:26,064 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 19:57:26,064 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-17 19:57:26,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:26,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:26,068 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:26,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 19:57:26,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:26,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:57:26,082 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:26,082 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 5 Supporting invariants [] [2025-03-17 19:57:26,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:26,178 INFO L156 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2025-03-17 19:57:26,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:26,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:26,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:26,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:26,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:26,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:57:26,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:26,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:57:26,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:26,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:26,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:26,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:57:26,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:26,278 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-17 19:57:26,279 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-03-17 19:57:26,330 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 60 states and 84 transitions. Complement of second has 10 states. [2025-03-17 19:57:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-17 19:57:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-03-17 19:57:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2025-03-17 19:57:26,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 13 letters. Loop has 10 letters. [2025-03-17 19:57:26,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:26,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 23 letters. Loop has 10 letters. [2025-03-17 19:57:26,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:26,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 13 letters. Loop has 20 letters. [2025-03-17 19:57:26,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:26,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 84 transitions. [2025-03-17 19:57:26,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-03-17 19:57:26,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 84 transitions. [2025-03-17 19:57:26,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-17 19:57:26,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-17 19:57:26,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 84 transitions. [2025-03-17 19:57:26,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:26,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-03-17 19:57:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 84 transitions. [2025-03-17 19:57:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-03-17 19:57:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.392156862745098) internal successors, (71), 50 states have internal predecessors, (71), 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) [2025-03-17 19:57:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2025-03-17 19:57:26,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 71 transitions. [2025-03-17 19:57:26,334 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2025-03-17 19:57:26,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:57:26,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 71 transitions. [2025-03-17 19:57:26,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-17 19:57:26,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:26,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:26,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:26,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2025-03-17 19:57:26,335 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:26,335 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:26,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash 46408578, now seen corresponding path program 6 times [2025-03-17 19:57:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:26,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592301311] [2025-03-17 19:57:26,336 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:57:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:26,342 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 3 equivalence classes. [2025-03-17 19:57:26,361 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:26,361 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 19:57:26,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:26,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:26,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:57:26,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:26,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:26,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:26,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:26,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash 170874847, now seen corresponding path program 1 times [2025-03-17 19:57:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:26,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-03-17 19:57:26,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:26,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:26,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:57:26,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:26,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:26,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:26,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:26,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:57:26,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:26,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:26,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:26,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash 755680672, now seen corresponding path program 1 times [2025-03-17 19:57:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836513397] [2025-03-17 19:57:26,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:26,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:57:26,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:57:26,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:26,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:57:26,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836513397] [2025-03-17 19:57:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836513397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230524562] [2025-03-17 19:57:26,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:26,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:26,546 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:26,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-03-17 19:57:26,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:57:26,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:57:26,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:26,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:26,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:57:26,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:57:26,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:26,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:57:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230524562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:26,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-17 19:57:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205411651] [2025-03-17 19:57:26,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:27,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:57:27,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:57:27,290 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. cyclomatic complexity: 23 Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 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) [2025-03-17 19:57:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:27,444 INFO L93 Difference]: Finished difference Result 139 states and 191 transitions. [2025-03-17 19:57:27,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 191 transitions. [2025-03-17 19:57:27,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2025-03-17 19:57:27,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 96 states and 135 transitions. [2025-03-17 19:57:27,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-03-17 19:57:27,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-03-17 19:57:27,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 135 transitions. [2025-03-17 19:57:27,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:27,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-03-17 19:57:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 135 transitions. [2025-03-17 19:57:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2025-03-17 19:57:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 62 states have internal predecessors, (86), 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) [2025-03-17 19:57:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-17 19:57:27,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-17 19:57:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 19:57:27,449 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-17 19:57:27,449 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:57:27,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 86 transitions. [2025-03-17 19:57:27,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-17 19:57:27,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:27,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:27,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:57:27,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2025-03-17 19:57:27,451 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:27,451 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-03-17 19:57:27,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash -457148680, now seen corresponding path program 1 times [2025-03-17 19:57:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066207746] [2025-03-17 19:57:27,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:27,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:57:27,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:57:27,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:27,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066207746] [2025-03-17 19:57:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066207746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796527898] [2025-03-17 19:57:28,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:28,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:28,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:28,275 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:28,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-03-17 19:57:28,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:57:28,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:57:28,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:28,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:28,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:57:28,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:28,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:57:28,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 19:57:28,472 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-03-17 19:57:28,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 25 [2025-03-17 19:57:28,594 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2025-03-17 19:57:28,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 53 [2025-03-17 19:57:28,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:28,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2025-03-17 19:57:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:28,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:41,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 117 [2025-03-17 19:57:41,547 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 19:57:41,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24083 treesize of output 21534 [2025-03-17 19:57:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796527898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:45,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:45,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2025-03-17 19:57:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436927615] [2025-03-17 19:57:45,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:45,012 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:45,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash 170874847, now seen corresponding path program 2 times [2025-03-17 19:57:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:45,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275082785] [2025-03-17 19:57:45,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:45,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:45,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-17 19:57:45,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:45,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:45,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:45,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:45,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:57:45,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:45,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:45,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:45,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:45,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 19:57:45,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 19:57:45,675 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. cyclomatic complexity: 26 Second operand has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 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) [2025-03-17 19:57:50,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:57:53,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 19:57:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:54,535 INFO L93 Difference]: Finished difference Result 241 states and 332 transitions. [2025-03-17 19:57:54,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 332 transitions. [2025-03-17 19:57:54,537 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 87 [2025-03-17 19:57:54,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 207 states and 282 transitions. [2025-03-17 19:57:54,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-03-17 19:57:54,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-03-17 19:57:54,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 282 transitions. [2025-03-17 19:57:54,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:54,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 207 states and 282 transitions. [2025-03-17 19:57:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 282 transitions. [2025-03-17 19:57:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 108. [2025-03-17 19:57:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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) [2025-03-17 19:57:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2025-03-17 19:57:54,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 146 transitions. [2025-03-17 19:57:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-17 19:57:54,547 INFO L432 stractBuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2025-03-17 19:57:54,547 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 19:57:54,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 146 transitions. [2025-03-17 19:57:54,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-17 19:57:54,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:54,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:54,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:57:54,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1] [2025-03-17 19:57:54,548 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:54,549 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:54,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1644962566, now seen corresponding path program 1 times [2025-03-17 19:57:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431511187] [2025-03-17 19:57:54,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:54,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:57:54,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:57:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:57:55,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431511187] [2025-03-17 19:57:55,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431511187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964588489] [2025-03-17 19:57:55,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:55,049 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:55,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-03-17 19:57:55,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:57:55,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:57:55,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:55,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:57:55,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:55,383 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 19:57:55,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 23 [2025-03-17 19:57:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:57:55,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:55,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:55,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 49 [2025-03-17 19:57:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:57:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964588489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:55,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 27 [2025-03-17 19:57:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804660131] [2025-03-17 19:57:55,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:55,625 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash -796086781, now seen corresponding path program 8 times [2025-03-17 19:57:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:55,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-03-17 19:57:55,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:55,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-17 19:57:55,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:55,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:55,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:55,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:55,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:57:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:57:55,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:55,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:55,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:56,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 19:57:56,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-17 19:57:56,798 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. cyclomatic complexity: 42 Second operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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) [2025-03-17 19:57:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:57,162 INFO L93 Difference]: Finished difference Result 165 states and 221 transitions. [2025-03-17 19:57:57,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 221 transitions. [2025-03-17 19:57:57,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-03-17 19:57:57,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 165 states and 221 transitions. [2025-03-17 19:57:57,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-03-17 19:57:57,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-03-17 19:57:57,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 221 transitions. [2025-03-17 19:57:57,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:57,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 165 states and 221 transitions. [2025-03-17 19:57:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 221 transitions. [2025-03-17 19:57:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2025-03-17 19:57:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 1.3375796178343948) internal successors, (210), 156 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) [2025-03-17 19:57:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 210 transitions. [2025-03-17 19:57:57,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 210 transitions. [2025-03-17 19:57:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:57:57,172 INFO L432 stractBuchiCegarLoop]: Abstraction has 157 states and 210 transitions. [2025-03-17 19:57:57,172 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 19:57:57,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 210 transitions. [2025-03-17 19:57:57,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2025-03-17 19:57:57,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:57,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:57,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:57,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1] [2025-03-17 19:57:57,173 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:57,173 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:57:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -846000934, now seen corresponding path program 2 times [2025-03-17 19:57:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-03-17 19:57:57,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:57,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:57:57,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:57:57,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:57,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:57:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-03-17 19:57:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296084512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227265721] [2025-03-17 19:57:57,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:57,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:57,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:57,807 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:57,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-03-17 19:57:57,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:57:57,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:57:57,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:57,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:57,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 19:57:57,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:57:57,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 19:57:58,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:57:58,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:57:58,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:58,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2025-03-17 19:57:58,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:58,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 24 [2025-03-17 19:57:58,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:58,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 19:57:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:57:58,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:59,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2025-03-17 19:57:59,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:57:59,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15675 treesize of output 14731 [2025-03-17 19:58:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:58:00,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227265721] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:00,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:00,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-03-17 19:58:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312542449] [2025-03-17 19:58:00,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:00,628 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:00,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash -796086781, now seen corresponding path program 9 times [2025-03-17 19:58:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092418584] [2025-03-17 19:58:00,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:00,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-03-17 19:58:00,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:58:00,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:58:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:00,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:58:00,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:58:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:00,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:01,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 19:58:01,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 19:58:01,598 INFO L87 Difference]: Start difference. First operand 157 states and 210 transitions. cyclomatic complexity: 59 Second operand has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 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) [2025-03-17 19:58:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:02,539 INFO L93 Difference]: Finished difference Result 195 states and 260 transitions. [2025-03-17 19:58:02,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 260 transitions. [2025-03-17 19:58:02,540 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 74 [2025-03-17 19:58:02,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 260 transitions. [2025-03-17 19:58:02,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-03-17 19:58:02,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-03-17 19:58:02,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 260 transitions. [2025-03-17 19:58:02,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:02,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 260 transitions. [2025-03-17 19:58:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 260 transitions. [2025-03-17 19:58:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 154. [2025-03-17 19:58:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 153 states have internal predecessors, (205), 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) [2025-03-17 19:58:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 205 transitions. [2025-03-17 19:58:02,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 205 transitions. [2025-03-17 19:58:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:58:02,545 INFO L432 stractBuchiCegarLoop]: Abstraction has 154 states and 205 transitions. [2025-03-17 19:58:02,545 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 19:58:02,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 205 transitions. [2025-03-17 19:58:02,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2025-03-17 19:58:02,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:02,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:02,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:02,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1] [2025-03-17 19:58:02,546 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:58:02,546 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-03-17 19:58:02,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash 896809401, now seen corresponding path program 3 times [2025-03-17 19:58:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686812680] [2025-03-17 19:58:02,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:02,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-17 19:58:02,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:58:02,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:58:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:02,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:02,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:58:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:58:02,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:02,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -796086781, now seen corresponding path program 10 times [2025-03-17 19:58:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:02,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481400594] [2025-03-17 19:58:02,582 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:02,588 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-03-17 19:58:02,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:58:02,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:02,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:02,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:02,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:58:02,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:58:02,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:02,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:02,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash -614627909, now seen corresponding path program 4 times [2025-03-17 19:58:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98638792] [2025-03-17 19:58:02,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:02,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 19:58:02,638 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:58:02,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:58:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98638792] [2025-03-17 19:58:03,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98638792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563938507] [2025-03-17 19:58:03,662 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:03,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:03,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:03,664 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:03,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-03-17 19:58:03,758 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 19:58:03,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:58:03,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:03,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:03,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 19:58:03,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:03,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:58:03,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 19:58:03,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 19:58:04,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:04,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:04,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:04,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2025-03-17 19:58:04,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:04,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2025-03-17 19:58:04,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:04,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 33 [2025-03-17 19:58:04,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:04,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2025-03-17 19:58:04,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:04,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 23 [2025-03-17 19:58:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:58:04,634 INFO L312 TraceCheckSpWp]: Computing backward predicates...