./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-12 00:19:22,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:19:23,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:19:23,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:19:23,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:19:23,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:19:23,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:19:23,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:19:23,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:19:23,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:19:23,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:19:23,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:19:23,042 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:19:23,043 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:19:23,043 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:19:23,043 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:19:23,044 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:19:23,044 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:19:23,044 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:19:23,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:19:23,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:19:23,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:19:23,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:19:23,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:19:23,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:19:23,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:19:23,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:19:23,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:19:23,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:19:23,052 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:19:23,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:19:23,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:19:23,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:19:23,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:19:23,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:19:23,055 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:19:23,055 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 [2024-10-12 00:19:23,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:19:23,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:19:23,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:19:23,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:19:23,428 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:19:23,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2024-10-12 00:19:25,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:19:25,568 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:19:25,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2024-10-12 00:19:25,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dd6e14737/94d4dfa9c5b14426b7b6a42736182c73/FLAG40eb6e07b [2024-10-12 00:19:25,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dd6e14737/94d4dfa9c5b14426b7b6a42736182c73 [2024-10-12 00:19:25,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:19:25,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:19:25,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:19:25,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:19:25,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:19:25,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:19:25" (1/1) ... [2024-10-12 00:19:25,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef61fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:25, skipping insertion in model container [2024-10-12 00:19:25,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:19:25" (1/1) ... [2024-10-12 00:19:25,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:19:26,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:19:26,043 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:19:26,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:19:26,129 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:19:26,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26 WrapperNode [2024-10-12 00:19:26,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:19:26,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:19:26,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:19:26,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:19:26,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,180 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 102 [2024-10-12 00:19:26,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:19:26,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:19:26,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:19:26,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:19:26,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,211 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, 2, 0]. [2024-10-12 00:19:26,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:19:26,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:19:26,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:19:26,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:19:26,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (1/1) ... [2024-10-12 00:19:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:26,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:26,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:26,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:19:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:19:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:19:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:19:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:19:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:19:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:19:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:19:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:19:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:19:26,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:19:26,470 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:19:26,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:19:26,620 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-12 00:19:26,620 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:19:26,638 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:19:26,639 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 00:19:26,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:19:26 BoogieIcfgContainer [2024-10-12 00:19:26,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:19:26,641 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:19:26,641 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:19:26,646 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:19:26,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:26,647 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:19:25" (1/3) ... [2024-10-12 00:19:26,648 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bdedac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:19:26, skipping insertion in model container [2024-10-12 00:19:26,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:26,648 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:26" (2/3) ... [2024-10-12 00:19:26,650 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bdedac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:19:26, skipping insertion in model container [2024-10-12 00:19:26,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:26,651 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:19:26" (3/3) ... [2024-10-12 00:19:26,652 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2024-10-12 00:19:26,711 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:19:26,712 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:19:26,712 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:19:26,712 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:19:26,712 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:19:26,712 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:19:26,712 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:19:26,712 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:19:26,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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) [2024-10-12 00:19:26,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 00:19:26,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:26,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:26,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:19:26,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:19:26,739 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:19:26,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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) [2024-10-12 00:19:26,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 00:19:26,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:26,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:26,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:19:26,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:19:26,748 INFO L745 eck$LassoCheckResult]: Stem: 20#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13#L-1true 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; 3#L565true assume !(main_~array_size~0#1 < 1); 18#L565-2true 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; 4#L552-3true [2024-10-12 00:19:26,748 INFO L747 eck$LassoCheckResult]: Loop: 4#L552-3true 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15#L552-2true lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4#L552-3true [2024-10-12 00:19:26,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-12 00:19:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512241233] [2024-10-12 00:19:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:26,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:26,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:26,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-10-12 00:19:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525896798] [2024-10-12 00:19:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:26,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:26,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:26,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-10-12 00:19:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:26,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426454505] [2024-10-12 00:19:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:28,051 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:28,052 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:28,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:28,055 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:28,055 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:28,055 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:28,055 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:28,055 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:28,055 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2024-10-12 00:19:28,055 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:28,055 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:28,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:28,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:29,117 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:29,121 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:19:29,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:19:29,139 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 [2024-10-12 00:19:29,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:19:29,183 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 [2024-10-12 00:19:29,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:19:29,218 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 [2024-10-12 00:19:29,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:29,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:29,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:19:29,259 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 [2024-10-12 00:19:29,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:19:29,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:19:29,300 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 [2024-10-12 00:19:29,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,342 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 [2024-10-12 00:19:29,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:19:29,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:19:29,410 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 [2024-10-12 00:19:29,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:29,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:29,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:19:29,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:19:29,449 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 [2024-10-12 00:19:29,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:19:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:19:29,486 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 [2024-10-12 00:19:29,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,519 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:19:29,522 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 [2024-10-12 00:19:29,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:19:29,559 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 [2024-10-12 00:19:29,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,608 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:19:29,610 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 [2024-10-12 00:19:29,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:19:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,647 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:19:29,650 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 [2024-10-12 00:19:29,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:19:29,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,686 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:19:29,688 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 [2024-10-12 00:19:29,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,721 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:19:29,724 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 [2024-10-12 00:19:29,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:19:29,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,756 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:19:29,758 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 [2024-10-12 00:19:29,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:29,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:29,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:19:29,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,797 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:19:29,803 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 [2024-10-12 00:19:29,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:29,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:29,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,843 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,845 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 [2024-10-12 00:19:29,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:19:29,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:19:29,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,910 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:19:29,917 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 [2024-10-12 00:19:29,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:29,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,951 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:19:29,953 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 [2024-10-12 00:19:29,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:29,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:29,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:29,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:19:29,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:29,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:29,983 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:29,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:19:29,987 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 [2024-10-12 00:19:29,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:29,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:29,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:29,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:29,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:29,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:30,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:30,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:30,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:19:30,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,017 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:19:30,020 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 [2024-10-12 00:19:30,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:30,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:30,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:30,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:30,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:30,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:30,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:30,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:30,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:30,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,053 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:19:30,055 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 [2024-10-12 00:19:30,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:30,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:30,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:30,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:30,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:30,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:30,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:30,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:30,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:19:30,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,085 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:19:30,086 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 [2024-10-12 00:19:30,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:30,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:30,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:30,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:30,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:30,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:30,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:30,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-12 00:19:30,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,127 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:19:30,129 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 [2024-10-12 00:19:30,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:30,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:30,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:30,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:30,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:30,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:30,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:30,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,170 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:19:30,172 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 [2024-10-12 00:19:30,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:30,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:30,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:30,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:30,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:30,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:30,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:19:30,267 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-10-12 00:19:30,267 INFO L444 ModelExtractionUtils]: 7 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-10-12 00:19:30,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,271 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:19:30,279 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:19:30,296 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:19:30,297 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:19:30,297 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 [] [2024-10-12 00:19:30,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:30,360 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2024-10-12 00:19:30,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:30,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:19:30,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:30,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:19:30,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:30,490 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 [2024-10-12 00:19:30,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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) [2024-10-12 00:19:30,535 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 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 40 states and 62 transitions. Complement of second has 6 states. [2024-10-12 00:19:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:30,544 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) [2024-10-12 00:19:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-10-12 00:19:30,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:19:30,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:30,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-12 00:19:30,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:30,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:19:30,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:30,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 62 transitions. [2024-10-12 00:19:30,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:19:30,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 18 states and 28 transitions. [2024-10-12 00:19:30,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:19:30,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:19:30,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2024-10-12 00:19:30,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:30,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-10-12 00:19:30,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2024-10-12 00:19:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-12 00:19:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 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) [2024-10-12 00:19:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-10-12 00:19:30,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-10-12 00:19:30,620 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-10-12 00:19:30,620 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:19:30,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-10-12 00:19:30,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:19:30,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:30,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:30,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:19:30,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:19:30,621 INFO L745 eck$LassoCheckResult]: Stem: 181#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 180#L-1 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; 164#L565 assume !(main_~array_size~0#1 < 1); 165#L565-2 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; 166#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 168#L552-4 lis_~i~0#1 := 1; 170#L554-3 [2024-10-12 00:19:30,621 INFO L747 eck$LassoCheckResult]: Loop: 170#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 171#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 172#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 170#L554-3 [2024-10-12 00:19:30,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:30,622 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-10-12 00:19:30,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:30,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880469376] [2024-10-12 00:19:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:30,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:30,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880469376] [2024-10-12 00:19:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880469376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:19:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:19:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:19:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483302264] [2024-10-12 00:19:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:19:30,736 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:19:30,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2024-10-12 00:19:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532337648] [2024-10-12 00:19:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:30,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:30,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:30,769 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:30,769 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:30,769 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:30,769 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:30,769 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:19:30,770 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,770 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:30,770 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:30,770 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2024-10-12 00:19:30,770 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:30,770 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:30,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,837 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:30,838 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:19:30,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,844 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:19:30,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:19:30,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:19:30,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:19:30,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,884 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:19:30,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:19:30,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:19:30,923 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:19:30,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:30,929 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:30,929 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:30,929 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:30,929 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:30,929 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:30,929 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,929 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:30,929 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:30,929 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2024-10-12 00:19:30,929 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:30,929 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:30,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:30,991 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:30,992 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:19:30,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:30,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:30,994 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:30,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:19:30,996 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 [2024-10-12 00:19:31,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:31,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:31,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:31,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:31,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:31,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:31,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:31,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:19:31,013 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:19:31,013 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:19:31,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:31,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:31,016 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:31,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:19:31,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:19:31,017 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:19:31,017 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:19:31,017 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 [] [2024-10-12 00:19:31,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:31,037 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:19:31,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:31,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:19:31,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:31,108 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:19:31,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:31,165 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:19:31,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2024-10-12 00:19:31,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 48 states and 81 transitions. Complement of second has 10 states. [2024-10-12 00:19:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2024-10-12 00:19:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2024-10-12 00:19:31,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 6 letters. Loop has 3 letters. [2024-10-12 00:19:31,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 9 letters. Loop has 3 letters. [2024-10-12 00:19:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 6 letters. Loop has 6 letters. [2024-10-12 00:19:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:31,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 81 transitions. [2024-10-12 00:19:31,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:19:31,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 37 states and 57 transitions. [2024-10-12 00:19:31,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-12 00:19:31,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:19:31,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2024-10-12 00:19:31,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:31,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 57 transitions. [2024-10-12 00:19:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2024-10-12 00:19:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2024-10-12 00:19:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 28 states have internal predecessors, (45), 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) [2024-10-12 00:19:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2024-10-12 00:19:31,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 45 transitions. [2024-10-12 00:19:31,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:31,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:19:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:19:31,289 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2024-10-12 00:19:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:31,344 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2024-10-12 00:19:31,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2024-10-12 00:19:31,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:19:31,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2024-10-12 00:19:31,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-12 00:19:31,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-12 00:19:31,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2024-10-12 00:19:31,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:31,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 45 transitions. [2024-10-12 00:19:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2024-10-12 00:19:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-10-12 00:19:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 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) [2024-10-12 00:19:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2024-10-12 00:19:31,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 44 transitions. [2024-10-12 00:19:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:19:31,363 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2024-10-12 00:19:31,363 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:19:31,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2024-10-12 00:19:31,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:19:31,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:31,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:31,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:31,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:31,364 INFO L745 eck$LassoCheckResult]: Stem: 370#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 365#L-1 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; 344#L565 assume !(main_~array_size~0#1 < 1); 345#L565-2 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; 346#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 347#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 348#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 349#L552-4 lis_~i~0#1 := 1; 350#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 351#L555-3 [2024-10-12 00:19:31,364 INFO L747 eck$LassoCheckResult]: Loop: 351#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 352#L556 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; 358#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 360#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 362#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 366#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 367#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 351#L555-3 [2024-10-12 00:19:31,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2024-10-12 00:19:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:31,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642294312] [2024-10-12 00:19:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:31,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:31,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642294312] [2024-10-12 00:19:31,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642294312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525745666] [2024-10-12 00:19:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:31,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:31,613 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:31,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-12 00:19:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:31,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:19:31,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:31,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525745666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:31,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:31,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-12 00:19:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249391053] [2024-10-12 00:19:31,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:31,732 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:19:31,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2024-10-12 00:19:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:31,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872324973] [2024-10-12 00:19:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:31,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:31,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:19:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:19:32,062 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:32,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:32,307 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2024-10-12 00:19:32,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 83 transitions. [2024-10-12 00:19:32,308 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-10-12 00:19:32,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 51 states and 74 transitions. [2024-10-12 00:19:32,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:19:32,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-12 00:19:32,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2024-10-12 00:19:32,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:32,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-10-12 00:19:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2024-10-12 00:19:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2024-10-12 00:19:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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) [2024-10-12 00:19:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2024-10-12 00:19:32,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2024-10-12 00:19:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:19:32,323 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2024-10-12 00:19:32,323 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:19:32,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2024-10-12 00:19:32,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:19:32,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:32,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:32,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:32,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:32,324 INFO L745 eck$LassoCheckResult]: Stem: 521#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 515#L-1 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; 493#L565 assume !(main_~array_size~0#1 < 1); 494#L565-2 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; 495#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 496#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 497#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 498#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 522#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 499#L552-4 lis_~i~0#1 := 1; 500#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 501#L555-3 [2024-10-12 00:19:32,324 INFO L747 eck$LassoCheckResult]: Loop: 501#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 502#L556 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; 506#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 510#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 512#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 517#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 518#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 501#L555-3 [2024-10-12 00:19:32,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2024-10-12 00:19:32,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:32,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904320389] [2024-10-12 00:19:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:32,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:32,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2024-10-12 00:19:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204986758] [2024-10-12 00:19:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:32,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:32,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2024-10-12 00:19:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910676251] [2024-10-12 00:19:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:19:32,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:32,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910676251] [2024-10-12 00:19:32,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910676251] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:32,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293544341] [2024-10-12 00:19:32,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:32,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:32,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:32,850 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:32,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-10-12 00:19:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:33,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:19:33,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:19:33,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:19:33,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293544341] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:33,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-12 00:19:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491288189] [2024-10-12 00:19:33,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:33,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:19:33,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:19:33,883 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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) [2024-10-12 00:19:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:34,140 INFO L93 Difference]: Finished difference Result 98 states and 141 transitions. [2024-10-12 00:19:34,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 141 transitions. [2024-10-12 00:19:34,145 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2024-10-12 00:19:34,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 79 states and 114 transitions. [2024-10-12 00:19:34,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-10-12 00:19:34,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-10-12 00:19:34,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 114 transitions. [2024-10-12 00:19:34,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:34,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2024-10-12 00:19:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 114 transitions. [2024-10-12 00:19:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2024-10-12 00:19:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 48 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) [2024-10-12 00:19:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-10-12 00:19:34,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-10-12 00:19:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:19:34,165 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-10-12 00:19:34,165 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:19:34,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 71 transitions. [2024-10-12 00:19:34,166 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 00:19:34,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:34,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:34,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:34,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:19:34,166 INFO L745 eck$LassoCheckResult]: Stem: 770#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 765#L-1 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; 745#L565 assume !(main_~array_size~0#1 < 1); 746#L565-2 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; 747#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 748#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 749#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 750#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 789#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 751#L552-4 lis_~i~0#1 := 1; 752#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 753#L555-3 [2024-10-12 00:19:34,167 INFO L747 eck$LassoCheckResult]: Loop: 753#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 754#L556 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; 758#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 762#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 753#L555-3 [2024-10-12 00:19:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2024-10-12 00:19:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588498120] [2024-10-12 00:19:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:34,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:34,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:34,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:34,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2024-10-12 00:19:34,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:34,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415515813] [2024-10-12 00:19:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:34,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:34,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:34,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2024-10-12 00:19:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:34,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438628076] [2024-10-12 00:19:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:34,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:34,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:35,534 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:35,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:35,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:35,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:35,535 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:35,535 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:35,535 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:35,535 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:35,535 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration5_Lasso [2024-10-12 00:19:35,535 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:35,535 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:35,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:35,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:36,544 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:36,544 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:19:36,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,553 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:19:36,555 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 [2024-10-12 00:19:36,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:19:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,589 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:19:36,592 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 [2024-10-12 00:19:36,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:36,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:36,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,630 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:19:36,633 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 [2024-10-12 00:19:36,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,664 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:19:36,666 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 [2024-10-12 00:19:36,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:36,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:36,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:19:36,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,699 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:19:36,701 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 [2024-10-12 00:19:36,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,733 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:19:36,735 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 [2024-10-12 00:19:36,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-12 00:19:36,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,767 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:19:36,770 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 [2024-10-12 00:19:36,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:36,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:36,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,803 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:19:36,805 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 [2024-10-12 00:19:36,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,839 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:19:36,841 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 [2024-10-12 00:19:36,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,874 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:19:36,876 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 [2024-10-12 00:19:36,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:19:36,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,909 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:19:36,911 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 [2024-10-12 00:19:36,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,941 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:19:36,943 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 [2024-10-12 00:19:36,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:36,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:36,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:36,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:36,973 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:36,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:19:36,977 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 [2024-10-12 00:19:36,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:36,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:36,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:36,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:36,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:36,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:36,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:36,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:37,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:37,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:37,007 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:37,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:19:37,009 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 [2024-10-12 00:19:37,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:37,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:37,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:37,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:37,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:37,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:37,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:37,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-12 00:19:37,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:37,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:37,050 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:37,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:19:37,052 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 [2024-10-12 00:19:37,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:37,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:37,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:37,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:37,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:37,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:37,098 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:19:37,167 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2024-10-12 00:19:37,167 INFO L444 ModelExtractionUtils]: 11 out of 43 variables were initially zero. Simplification set additionally 29 variables to zero. [2024-10-12 00:19:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:37,169 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:37,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:19:37,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:19:37,187 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:19:37,187 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:19:37,187 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0#1) = -2*ULTIMATE.start_lis_~j~0#1 + 1 Supporting invariants [] [2024-10-12 00:19:37,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:37,310 INFO L156 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2024-10-12 00:19:37,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:37,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:19:37,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:37,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:19:37,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:37,490 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:19:37,491 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-10-12 00:19:37,583 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Result 63 states and 97 transitions. Complement of second has 6 states. [2024-10-12 00:19:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-10-12 00:19:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-12 00:19:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-12 00:19:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-12 00:19:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 8 letters. [2024-10-12 00:19:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:37,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 97 transitions. [2024-10-12 00:19:37,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:19:37,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 47 states and 69 transitions. [2024-10-12 00:19:37,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-12 00:19:37,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-12 00:19:37,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 69 transitions. [2024-10-12 00:19:37,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:37,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 69 transitions. [2024-10-12 00:19:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 69 transitions. [2024-10-12 00:19:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-10-12 00:19:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 42 states have internal predecessors, (62), 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) [2024-10-12 00:19:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2024-10-12 00:19:37,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 62 transitions. [2024-10-12 00:19:37,592 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 62 transitions. [2024-10-12 00:19:37,592 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:19:37,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 62 transitions. [2024-10-12 00:19:37,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:19:37,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:37,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:37,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:37,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:37,593 INFO L745 eck$LassoCheckResult]: Stem: 1055#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1049#L-1 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; 1025#L565 assume !(main_~array_size~0#1 < 1); 1026#L565-2 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; 1027#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1028#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1029#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1030#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1059#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1057#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1056#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1031#L552-4 lis_~i~0#1 := 1; 1032#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1035#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1036#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1052#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1058#L555-3 [2024-10-12 00:19:37,594 INFO L747 eck$LassoCheckResult]: Loop: 1058#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1038#L556 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; 1039#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1043#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1045#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1063#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1060#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1058#L555-3 [2024-10-12 00:19:37,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2024-10-12 00:19:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403571395] [2024-10-12 00:19:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:37,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-12 00:19:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 00:19:37,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403571395] [2024-10-12 00:19:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403571395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:19:37,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:19:37,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:19:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275115896] [2024-10-12 00:19:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:19:37,696 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:19:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2024-10-12 00:19:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:37,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3906150] [2024-10-12 00:19:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:37,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:37,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:19:38,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:19:38,327 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-10-12 00:19:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:38,376 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2024-10-12 00:19:38,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 76 transitions. [2024-10-12 00:19:38,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:19:38,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 76 transitions. [2024-10-12 00:19:38,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-12 00:19:38,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-12 00:19:38,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 76 transitions. [2024-10-12 00:19:38,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:38,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-12 00:19:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 76 transitions. [2024-10-12 00:19:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2024-10-12 00:19:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 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) [2024-10-12 00:19:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-10-12 00:19:38,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-10-12 00:19:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:19:38,395 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-10-12 00:19:38,395 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:19:38,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2024-10-12 00:19:38,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:19:38,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:38,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:38,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:38,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:38,396 INFO L745 eck$LassoCheckResult]: Stem: 1155#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1149#L-1 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; 1127#L565 assume !(main_~array_size~0#1 < 1); 1128#L565-2 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; 1129#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1130#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1131#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1132#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1163#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1158#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1157#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1133#L552-4 lis_~i~0#1 := 1; 1134#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1135#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1136#L556 assume !lis_#t~short9#1; 1167#L556-2 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; 1166#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1165#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1151#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1152#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1160#L555-3 [2024-10-12 00:19:38,396 INFO L747 eck$LassoCheckResult]: Loop: 1160#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1139#L556 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; 1140#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1144#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1146#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1164#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1159#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1160#L555-3 [2024-10-12 00:19:38,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 1 times [2024-10-12 00:19:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:38,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75212947] [2024-10-12 00:19:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:38,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:38,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:38,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 4 times [2024-10-12 00:19:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:38,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974183876] [2024-10-12 00:19:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:38,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:38,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1322701164, now seen corresponding path program 1 times [2024-10-12 00:19:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822553333] [2024-10-12 00:19:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 00:19:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822553333] [2024-10-12 00:19:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822553333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632298295] [2024-10-12 00:19:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:38,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:38,600 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:38,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2024-10-12 00:19:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:38,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:19:38,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 00:19:38,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 00:19:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632298295] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:38,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 00:19:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052321986] [2024-10-12 00:19:38,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:39,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 00:19:39,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-12 00:19:39,040 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2024-10-12 00:19:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:39,171 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2024-10-12 00:19:39,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 83 transitions. [2024-10-12 00:19:39,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:19:39,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 38 states and 52 transitions. [2024-10-12 00:19:39,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:19:39,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:19:39,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2024-10-12 00:19:39,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:39,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-10-12 00:19:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2024-10-12 00:19:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-10-12 00:19:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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) [2024-10-12 00:19:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-10-12 00:19:39,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-10-12 00:19:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:19:39,183 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-10-12 00:19:39,183 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:19:39,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2024-10-12 00:19:39,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:19:39,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:39,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:39,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:39,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2024-10-12 00:19:39,185 INFO L745 eck$LassoCheckResult]: Stem: 1426#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1423#L-1 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; 1401#L565 assume !(main_~array_size~0#1 < 1); 1402#L565-2 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; 1403#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1404#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1405#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1406#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1432#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1428#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1427#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1407#L552-4 lis_~i~0#1 := 1; 1408#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1429#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1413#L556 assume !lis_#t~short9#1; 1415#L556-2 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; 1419#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1411#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1412#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1424#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1425#L555-3 [2024-10-12 00:19:39,185 INFO L747 eck$LassoCheckResult]: Loop: 1425#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1435#L556 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; 1434#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1420#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1409#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1410#L556 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; 1414#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1418#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1433#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1431#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1430#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1425#L555-3 [2024-10-12 00:19:39,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 2 times [2024-10-12 00:19:39,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:39,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396468826] [2024-10-12 00:19:39,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:39,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:39,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:39,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 5 times [2024-10-12 00:19:39,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:39,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993220404] [2024-10-12 00:19:39,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:39,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:39,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:39,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:39,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash -840393243, now seen corresponding path program 2 times [2024-10-12 00:19:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113826887] [2024-10-12 00:19:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 00:19:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113826887] [2024-10-12 00:19:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113826887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777391902] [2024-10-12 00:19:39,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:19:39,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:39,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:39,663 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:39,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-10-12 00:19:39,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:19:39,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:19:39,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:19:39,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 00:19:39,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 00:19:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777391902] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:39,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-12 00:19:39,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175385113] [2024-10-12 00:19:39,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 00:19:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 00:19:40,511 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 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) [2024-10-12 00:19:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:40,674 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2024-10-12 00:19:40,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 140 transitions. [2024-10-12 00:19:40,675 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-10-12 00:19:40,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 89 states and 123 transitions. [2024-10-12 00:19:40,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-10-12 00:19:40,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-10-12 00:19:40,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 123 transitions. [2024-10-12 00:19:40,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:40,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-12 00:19:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 123 transitions. [2024-10-12 00:19:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2024-10-12 00:19:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 60 states have internal predecessors, (84), 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) [2024-10-12 00:19:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2024-10-12 00:19:40,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 84 transitions. [2024-10-12 00:19:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:19:40,681 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 84 transitions. [2024-10-12 00:19:40,681 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:19:40,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 84 transitions. [2024-10-12 00:19:40,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-10-12 00:19:40,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:40,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:40,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:40,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:19:40,683 INFO L745 eck$LassoCheckResult]: Stem: 1770#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1765#L-1 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; 1744#L565 assume !(main_~array_size~0#1 < 1); 1745#L565-2 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; 1746#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1747#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1779#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1781#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1748#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1749#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1804#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1803#L552-4 lis_~i~0#1 := 1; 1802#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1801#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1798#L556 assume !lis_#t~short9#1; 1800#L556-2 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; 1799#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1797#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1796#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1769#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1750#L555-3 [2024-10-12 00:19:40,683 INFO L747 eck$LassoCheckResult]: Loop: 1750#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 1751#L556 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; 1757#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1761#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1750#L555-3 [2024-10-12 00:19:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 3 times [2024-10-12 00:19:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590293103] [2024-10-12 00:19:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:40,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 2 times [2024-10-12 00:19:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049180904] [2024-10-12 00:19:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash -423959456, now seen corresponding path program 3 times [2024-10-12 00:19:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:40,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20250441] [2024-10-12 00:19:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:40,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:42,442 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:42,443 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:42,443 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:42,443 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:42,443 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:42,443 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:42,443 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:42,443 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:42,443 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration9_Lasso [2024-10-12 00:19:42,443 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:42,444 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:42,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:43,560 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:43,561 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:19:43,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:43,563 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:43,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:19:43,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 [2024-10-12 00:19:43,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:43,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:43,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:43,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:43,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:43,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:43,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:43,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-12 00:19:43,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:43,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:43,599 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:43,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:19:43,601 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 [2024-10-12 00:19:43,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:43,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:43,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:43,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:43,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:43,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:43,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:43,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:43,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:43,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:43,634 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:43,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:19:43,636 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 [2024-10-12 00:19:43,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:43,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:43,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:43,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:43,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:43,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:43,678 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:19:43,725 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-10-12 00:19:43,726 INFO L444 ModelExtractionUtils]: 9 out of 43 variables were initially zero. Simplification set additionally 30 variables to zero. [2024-10-12 00:19:43,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:43,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:43,728 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:43,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:19:43,730 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:19:43,743 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-12 00:19:43,743 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:19:43,743 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0#1, v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_3) = -48*ULTIMATE.start_lis_~j~0#1 + 5*v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_3 Supporting invariants [1*ULTIMATE.start_lis_~prev~0#1.offset >= 0] [2024-10-12 00:19:43,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:43,845 INFO L156 tatePredicateManager]: 28 out of 31 supporting invariants were superfluous and have been removed [2024-10-12 00:19:43,851 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:19:43,852 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:19:43,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:43,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:19:43,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:44,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:19:44,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:44,106 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-10-12 00:19:44,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 30 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:44,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 30. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 88 transitions. Complement of second has 5 states. [2024-10-12 00:19:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-12 00:19:44,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-12 00:19:44,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:44,137 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:44,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:44,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:19:44,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:44,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:19:44,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:44,392 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2024-10-12 00:19:44,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 30 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:44,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 30. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 88 transitions. Complement of second has 5 states. [2024-10-12 00:19:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-12 00:19:44,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-12 00:19:44,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:44,420 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:44,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:44,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:19:44,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:44,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:19:44,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:44,679 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-10-12 00:19:44,679 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 30 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:44,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:44,844 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 30. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 94 states and 136 transitions. Complement of second has 13 states. [2024-10-12 00:19:44,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2024-10-12 00:19:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2024-10-12 00:19:44,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 55 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-12 00:19:44,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:44,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 55 transitions. Stem has 24 letters. Loop has 4 letters. [2024-10-12 00:19:44,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:44,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 55 transitions. Stem has 20 letters. Loop has 8 letters. [2024-10-12 00:19:44,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:44,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 136 transitions. [2024-10-12 00:19:44,848 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-10-12 00:19:44,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 88 states and 122 transitions. [2024-10-12 00:19:44,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-10-12 00:19:44,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-12 00:19:44,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 122 transitions. [2024-10-12 00:19:44,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:44,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-10-12 00:19:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 122 transitions. [2024-10-12 00:19:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-10-12 00:19:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 80 states have internal predecessors, (113), 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) [2024-10-12 00:19:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2024-10-12 00:19:44,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 113 transitions. [2024-10-12 00:19:44,853 INFO L425 stractBuchiCegarLoop]: Abstraction has 81 states and 113 transitions. [2024-10-12 00:19:44,854 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:19:44,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 113 transitions. [2024-10-12 00:19:44,854 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-10-12 00:19:44,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:44,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:44,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:44,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:19:44,855 INFO L745 eck$LassoCheckResult]: Stem: 2462#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2458#L-1 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; 2434#L565 assume !(main_~array_size~0#1 < 1); 2435#L565-2 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; 2436#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2437#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2438#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2439#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2514#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2513#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2512#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 2511#L552-4 lis_~i~0#1 := 1; 2510#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2442#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 2443#L556 assume !lis_#t~short9#1; 2507#L556-2 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; 2504#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 2503#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2460#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 2461#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2509#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 2500#L556 [2024-10-12 00:19:44,855 INFO L747 eck$LassoCheckResult]: Loop: 2500#L556 assume !lis_#t~short9#1; 2452#L556-2 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; 2453#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 2456#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 2500#L556 [2024-10-12 00:19:44,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash -16593778, now seen corresponding path program 4 times [2024-10-12 00:19:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:44,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168356238] [2024-10-12 00:19:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:44,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:44,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:44,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:44,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2284026, now seen corresponding path program 1 times [2024-10-12 00:19:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105025257] [2024-10-12 00:19:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:44,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:44,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash -257779705, now seen corresponding path program 5 times [2024-10-12 00:19:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377645128] [2024-10-12 00:19:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:44,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:44,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:47,936 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:47,937 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:47,937 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:47,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:47,937 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:47,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:47,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:47,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:47,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration10_Lasso [2024-10-12 00:19:47,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:47,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:47,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:47,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:47,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:48,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:49,015 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:49,015 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:19:49,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,018 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:19:49,021 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 [2024-10-12 00:19:49,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:49,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:49,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:49,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:49,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:49,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:49,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-12 00:19:49,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,052 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:19:49,054 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 [2024-10-12 00:19:49,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:49,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:49,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:49,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:49,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:49,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:49,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:49,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,087 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:19:49,090 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 [2024-10-12 00:19:49,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:49,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:49,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:49,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:49,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:49,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:49,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,123 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:19:49,124 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 [2024-10-12 00:19:49,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:49,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:49,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:49,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:49,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:49,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:19:49,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,158 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:19:49,160 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 [2024-10-12 00:19:49,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:49,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:49,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:49,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:49,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:49,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 00:19:49,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,223 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:19:49,237 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 [2024-10-12 00:19:49,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,250 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-12 00:19:49,250 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:19:49,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,261 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-10-12 00:19:49,262 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:19:49,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:49,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:49,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,356 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:19:49,362 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 [2024-10-12 00:19:49,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:49,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:49,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:49,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:49,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:49,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:49,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,402 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:19:49,404 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 [2024-10-12 00:19:49,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:49,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:49,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:49,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:49,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:49,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:49,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:19:49,507 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2024-10-12 00:19:49,507 INFO L444 ModelExtractionUtils]: 11 out of 34 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-10-12 00:19:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:49,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:49,511 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:49,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:19:49,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:19:49,536 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:19:49,536 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:19:49,536 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0#1, ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~j~0#1 + 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2024-10-12 00:19:49,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:49,621 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2024-10-12 00:19:49,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:49,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:19:49,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:49,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:19:49,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:49,858 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:19:49,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 113 transitions. cyclomatic complexity: 41 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2024-10-12 00:19:49,912 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 113 transitions. cyclomatic complexity: 41. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 83 states and 117 transitions. Complement of second has 4 states. [2024-10-12 00:19:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2024-10-12 00:19:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-10-12 00:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 21 letters. Loop has 4 letters. [2024-10-12 00:19:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:49,913 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:49,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:50,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:19:50,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:50,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:19:50,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:50,098 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:19:50,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 113 transitions. cyclomatic complexity: 41 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2024-10-12 00:19:50,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 113 transitions. cyclomatic complexity: 41. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 83 states and 117 transitions. Complement of second has 4 states. [2024-10-12 00:19:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2024-10-12 00:19:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-10-12 00:19:50,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 21 letters. Loop has 4 letters. [2024-10-12 00:19:50,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:50,129 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:50,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:50,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:19:50,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:50,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:19:50,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:50,263 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:19:50,264 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 113 transitions. cyclomatic complexity: 41 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2024-10-12 00:19:50,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 113 transitions. cyclomatic complexity: 41. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 108 states and 149 transitions. Complement of second has 10 states. [2024-10-12 00:19:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:19:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2024-10-12 00:19:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2024-10-12 00:19:50,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 21 letters. Loop has 4 letters. [2024-10-12 00:19:50,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:50,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 25 letters. Loop has 4 letters. [2024-10-12 00:19:50,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:50,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 21 letters. Loop has 8 letters. [2024-10-12 00:19:50,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:50,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 149 transitions. [2024-10-12 00:19:50,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:19:50,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 68 states and 94 transitions. [2024-10-12 00:19:50,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:19:50,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-12 00:19:50,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 94 transitions. [2024-10-12 00:19:50,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:50,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-10-12 00:19:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 94 transitions. [2024-10-12 00:19:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-12 00:19:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 58 states have internal predecessors, (82), 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) [2024-10-12 00:19:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2024-10-12 00:19:50,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 82 transitions. [2024-10-12 00:19:50,358 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2024-10-12 00:19:50,358 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:19:50,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 82 transitions. [2024-10-12 00:19:50,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:19:50,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:50,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:50,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:50,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2024-10-12 00:19:50,360 INFO L745 eck$LassoCheckResult]: Stem: 3170#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3166#L-1 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; 3141#L565 assume !(main_~array_size~0#1 < 1); 3142#L565-2 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; 3143#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3144#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3145#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3146#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3167#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3179#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3176#L552-3 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#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3172#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3171#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 3152#L552-4 lis_~i~0#1 := 1; 3153#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3192#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 3189#L556 assume !lis_#t~short9#1; 3191#L556-2 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; 3190#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3188#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3168#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 3169#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3147#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 3148#L556 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; 3155#L556-2 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; 3161#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3163#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 3195#L556 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; 3194#L556-2 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; 3160#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3162#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3187#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 3186#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3174#L555-3 [2024-10-12 00:19:50,360 INFO L747 eck$LassoCheckResult]: Loop: 3174#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 3185#L556 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; 3184#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3183#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3182#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(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; 3178#L556 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; 3181#L556-2 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#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3180#L555-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3177#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3175#L554-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 3173#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3174#L555-3 [2024-10-12 00:19:50,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1480396999, now seen corresponding path program 1 times [2024-10-12 00:19:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444129697] [2024-10-12 00:19:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:50,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-12 00:19:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 00:19:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444129697] [2024-10-12 00:19:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444129697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984887980] [2024-10-12 00:19:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:51,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:51,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:51,271 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:51,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-10-12 00:19:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:51,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 00:19:51,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:51,457 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 [2024-10-12 00:19:51,504 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 [2024-10-12 00:19:51,576 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-10-12 00:19:51,577 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 [2024-10-12 00:19:51,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:19:51,817 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 [2024-10-12 00:19:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:19:51,860 INFO L311 TraceCheckSpWp]: Computing backward predicates...