./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:25:06,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:25:06,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:25:06,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:25:06,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:25:06,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:25:06,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:25:06,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:25:06,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:25:06,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:25:06,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:25:06,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:25:06,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:25:06,987 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:25:06,988 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:25:06,988 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:25:06,988 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:25:06,988 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:25:06,989 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:25:06,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:25:06,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:25:06,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:25:06,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:25:06,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:25:06,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:25:06,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:25:06,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:25:06,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:25:06,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:25:06,992 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:25:06,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:25:06,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:25:06,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:25:06,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:25:06,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:25:06,994 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:25:06,994 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/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/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 -> 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 [2024-11-09 15:25:07,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:25:07,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:25:07,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:25:07,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:25:07,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:25:07,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2024-11-09 15:25:08,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:25:09,061 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:25:09,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2024-11-09 15:25:09,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d9c7663/dcb55ed6313c4b7fa77890cdd95254c4/FLAGb99fb14e2 [2024-11-09 15:25:09,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d9c7663/dcb55ed6313c4b7fa77890cdd95254c4 [2024-11-09 15:25:09,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:25:09,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:25:09,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:09,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:25:09,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:25:09,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6391e57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09, skipping insertion in model container [2024-11-09 15:25:09,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:25:09,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:09,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:25:09,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:09,515 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:25:09,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09 WrapperNode [2024-11-09 15:25:09,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:09,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:09,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:25:09,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:25:09,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,549 INFO L138 Inliner]: procedures = 110, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-11-09 15:25:09,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:09,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:25:09,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:25:09,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:25:09,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,579 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-09 15:25:09,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:25:09,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:25:09,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:25:09,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:25:09,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (1/1) ... [2024-11-09 15:25:09,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:09,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:09,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:25:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:25:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:25:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:25:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:25:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:25:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:25:09,787 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:25:09,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:25:09,883 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-09 15:25:09,884 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:25:09,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:25:09,895 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 15:25:09,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:09 BoogieIcfgContainer [2024-11-09 15:25:09,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:25:09,897 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:25:09,897 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:25:09,900 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:25:09,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:09,901 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:25:09" (1/3) ... [2024-11-09 15:25:09,902 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dad9b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:09, skipping insertion in model container [2024-11-09 15:25:09,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:09,903 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:09" (2/3) ... [2024-11-09 15:25:09,903 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dad9b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:09, skipping insertion in model container [2024-11-09 15:25:09,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:09,904 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:09" (3/3) ... [2024-11-09 15:25:09,905 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-2.i [2024-11-09 15:25:09,957 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:25:09,957 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:25:09,957 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:25:09,958 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:25:09,958 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:25:09,958 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:25:09,958 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:25:09,958 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:25:09,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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-11-09 15:25:09,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-09 15:25:09,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:09,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:09,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:25:09,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:09,977 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:25:09,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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-11-09 15:25:09,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-09 15:25:09,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:09,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:09,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:25:09,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:09,984 INFO L745 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 16#L551true assume !(main_~length~0#1 < 1); 10#L551-2true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 8#L553true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15#L554-3true [2024-11-09 15:25:09,984 INFO L747 eck$LassoCheckResult]: Loop: 15#L554-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3#L556true assume main_~val~0#1 < 0;main_~val~0#1 := 0; 4#L556-2true call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L554-2true main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15#L554-3true [2024-11-09 15:25:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-11-09 15:25:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:09,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869111897] [2024-11-09 15:25:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:10,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:10,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:10,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:10,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2024-11-09 15:25:10,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:10,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773138915] [2024-11-09 15:25:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:10,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:10,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:10,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2024-11-09 15:25:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611165108] [2024-11-09 15:25:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:10,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:10,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:10,539 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:10,540 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:10,540 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:10,540 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:10,541 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:10,541 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,541 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:10,541 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:10,541 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration1_Lasso [2024-11-09 15:25:10,541 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:10,541 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:10,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:11,048 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:11,053 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:11,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:11,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:11,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:11,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:25:11,059 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-11-09 15:25:11,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:11,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:11,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:11,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:11,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:11,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:11,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:11,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:11,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 15:25:11,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:11,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:11,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:11,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:25:11,101 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-11-09 15:25:11,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:11,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:11,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:11,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:11,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:11,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:11,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:11,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:11,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:11,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:11,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:11,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:25:11,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-11-09 15:25:11,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:11,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:11,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:11,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:11,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:11,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:11,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:11,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:11,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:11,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:11,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:11,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:11,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:25:11,177 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-11-09 15:25:11,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:11,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:11,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:11,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:11,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:11,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:11,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:11,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:11,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:25:11,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:11,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:11,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:25:11,214 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-11-09 15:25:11,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:11,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:11,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:11,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:11,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:11,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:11,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:11,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:25:11,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:11,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:11,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:11,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:25:11,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:11,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:11,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:11,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:11,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:11,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:11,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:11,294 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:11,345 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-09 15:25:11,345 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-09 15:25:11,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:11,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:11,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:11,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:25:11,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:11,369 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:11,369 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:11,370 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:25:11,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:25:11,403 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-11-09 15:25:11,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:25:11,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:25:11,416 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-09 15:25:11,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:11,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:25:11,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:11,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:25:11,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:11,577 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-11-09 15:25:11,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-09 15:25:11,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 34 states and 48 transitions. Complement of second has 9 states. [2024-11-09 15:25:11,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-09 15:25:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2024-11-09 15:25:11,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-09 15:25:11,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:11,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-09 15:25:11,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:11,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-09 15:25:11,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:11,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 48 transitions. [2024-11-09 15:25:11,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:11,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 15 states and 21 transitions. [2024-11-09 15:25:11,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:11,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:25:11,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2024-11-09 15:25:11,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:11,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-09 15:25:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2024-11-09 15:25:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 15:25:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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-11-09 15:25:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-11-09 15:25:11,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-09 15:25:11,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-09 15:25:11,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:25:11,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-11-09 15:25:11,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:11,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:11,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:11,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:11,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:25:11,710 INFO L745 eck$LassoCheckResult]: Stem: 139#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 131#L551 assume !(main_~length~0#1 < 1); 135#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 133#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 134#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 132#L554-4 main_~j~0#1 := 0; 129#L561-3 [2024-11-09 15:25:11,710 INFO L747 eck$LassoCheckResult]: Loop: 129#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 137#L562-3 assume !true; 128#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 129#L561-3 [2024-11-09 15:25:11,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2024-11-09 15:25:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879826741] [2024-11-09 15:25:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:11,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:11,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879826741] [2024-11-09 15:25:11,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879826741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:11,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:25:11,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:25:11,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272612833] [2024-11-09 15:25:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:11,828 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash 72876, now seen corresponding path program 1 times [2024-11-09 15:25:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:11,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133891401] [2024-11-09 15:25:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133891401] [2024-11-09 15:25:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133891401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:11,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:25:11,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:25:11,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839833381] [2024-11-09 15:25:11,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:11,843 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:25:11,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:25:11,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:25:11,846 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-11-09 15:25:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:11,852 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-11-09 15:25:11,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2024-11-09 15:25:11,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:11,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2024-11-09 15:25:11,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:11,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:25:11,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-11-09 15:25:11,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:11,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:25:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-11-09 15:25:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 15:25:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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-11-09 15:25:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-09 15:25:11,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:25:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:25:11,859 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:25:11,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:25:11,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-11-09 15:25:11,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:11,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:11,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:11,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:11,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:11,862 INFO L745 eck$LassoCheckResult]: Stem: 176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 168#L551 assume !(main_~length~0#1 < 1); 172#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 170#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 171#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 169#L554-4 main_~j~0#1 := 0; 166#L561-3 [2024-11-09 15:25:11,862 INFO L747 eck$LassoCheckResult]: Loop: 166#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 174#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 173#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 165#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 166#L561-3 [2024-11-09 15:25:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 2 times [2024-11-09 15:25:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068720930] [2024-11-09 15:25:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:11,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068720930] [2024-11-09 15:25:11,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068720930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:11,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:25:11,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:25:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341559922] [2024-11-09 15:25:11,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:11,933 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:11,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2024-11-09 15:25:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518918882] [2024-11-09 15:25:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:11,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:11,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:11,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:11,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 15:25:12,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:25:12,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:25:12,022 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-11-09 15:25:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:12,047 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-09 15:25:12,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-11-09 15:25:12,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:12,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2024-11-09 15:25:12,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:12,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:25:12,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-11-09 15:25:12,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:12,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-09 15:25:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-11-09 15:25:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2024-11-09 15:25:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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-11-09 15:25:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-09 15:25:12,054 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-09 15:25:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:25:12,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-09 15:25:12,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:25:12,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-11-09 15:25:12,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:25:12,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:12,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:12,056 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:12,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:12,057 INFO L745 eck$LassoCheckResult]: Stem: 216#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 209#L551 assume !(main_~length~0#1 < 1); 214#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 210#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 211#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 202#L556 assume !(main_~val~0#1 < 0); 203#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 204#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 215#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 207#L554-4 main_~j~0#1 := 0; 206#L561-3 [2024-11-09 15:25:12,057 INFO L747 eck$LassoCheckResult]: Loop: 206#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 213#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 212#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 205#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 206#L561-3 [2024-11-09 15:25:12,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2024-11-09 15:25:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:12,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15612266] [2024-11-09 15:25:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:12,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:12,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:12,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2024-11-09 15:25:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177867858] [2024-11-09 15:25:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:12,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:12,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:12,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:12,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2024-11-09 15:25:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:12,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155238366] [2024-11-09 15:25:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:12,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:12,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:12,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:12,364 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:12,364 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:12,364 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:12,364 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:12,364 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:12,364 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:12,364 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:12,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:12,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration4_Lasso [2024-11-09 15:25:12,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:12,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:12,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:12,690 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:12,690 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:12,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:12,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:12,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:12,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:25:12,695 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-11-09 15:25:12,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:12,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:12,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:12,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:12,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:12,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:12,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:12,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:12,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:12,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:12,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:12,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:12,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:25:12,721 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-11-09 15:25:12,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:12,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:12,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:12,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:12,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:12,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:12,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:12,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:12,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:25:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:12,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:12,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:25:12,746 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-11-09 15:25:12,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:12,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:12,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:12,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:12,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:12,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:12,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:12,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:12,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:12,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:12,770 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:12,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:25:12,771 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-11-09 15:25:12,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:12,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:12,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:12,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:12,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:12,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:12,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:12,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:12,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:12,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:12,800 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:12,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:25:12,802 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-11-09 15:25:12,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:12,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:12,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:12,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:12,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:12,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:12,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:12,858 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-09 15:25:12,859 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 15:25:12,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:12,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:12,861 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:12,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:25:12,863 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:12,879 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:12,880 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:12,880 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 2*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-09 15:25:12,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:12,899 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-11-09 15:25:12,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:25:12,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:25:12,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-09 15:25:12,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:12,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:25:12,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:13,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:25:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:13,015 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:25:13,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:13,081 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-11-09 15:25:13,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:13,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 27 transitions. Complement of second has 7 states. [2024-11-09 15:25:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2024-11-09 15:25:13,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-09 15:25:13,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:13,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-09 15:25:13,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:13,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2024-11-09 15:25:13,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:13,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-11-09 15:25:13,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:13,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-11-09 15:25:13,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:13,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:25:13,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-09 15:25:13,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:13,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 15:25:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-09 15:25:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-09 15:25:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-11-09 15:25:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-09 15:25:13,143 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-09 15:25:13,143 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-09 15:25:13,143 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:25:13,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-11-09 15:25:13,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:13,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:13,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:13,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:13,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:13,146 INFO L745 eck$LassoCheckResult]: Stem: 341#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 330#L551 assume !(main_~length~0#1 < 1); 335#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 333#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 334#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 324#L556 assume !(main_~val~0#1 < 0); 325#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 326#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 340#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 331#L554-4 main_~j~0#1 := 0; 332#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 337#L562-3 [2024-11-09 15:25:13,146 INFO L747 eck$LassoCheckResult]: Loop: 337#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 336#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 337#L562-3 [2024-11-09 15:25:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2024-11-09 15:25:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:13,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078876162] [2024-11-09 15:25:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:13,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:13,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:13,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2024-11-09 15:25:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:13,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132487443] [2024-11-09 15:25:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:13,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:13,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:13,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:13,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2024-11-09 15:25:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:13,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699314128] [2024-11-09 15:25:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:13,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:13,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:13,407 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:13,407 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:13,407 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:13,407 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:13,407 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:13,407 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:13,407 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:13,408 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:13,408 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration5_Lasso [2024-11-09 15:25:13,408 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:13,408 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:13,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:13,726 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:13,727 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:13,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:13,730 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:13,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:25:13,734 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-11-09 15:25:13,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:13,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:13,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:13,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:13,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:13,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:13,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:13,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:13,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:13,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:13,771 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:13,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:25:13,774 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-11-09 15:25:13,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:13,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:13,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:13,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:13,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:13,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:13,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:13,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:25:13,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:13,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:13,813 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:13,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:25:13,815 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-11-09 15:25:13,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:13,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:13,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:13,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:13,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:13,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:13,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:13,857 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:25:13,857 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:25:13,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:13,860 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:13,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:25:13,861 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:13,877 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:13,877 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:13,877 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2 Supporting invariants [] [2024-11-09 15:25:13,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:25:13,905 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-09 15:25:13,907 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:13,908 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:13,908 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:13,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:25:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:13,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:25:13,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:14,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:14,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:14,064 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-11-09 15:25:14,065 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:14,125 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 35 transitions. Complement of second has 9 states. [2024-11-09 15:25:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-11-09 15:25:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2024-11-09 15:25:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:14,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-09 15:25:14,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:14,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-09 15:25:14,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:14,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-11-09 15:25:14,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:14,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2024-11-09 15:25:14,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:14,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:14,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-11-09 15:25:14,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:14,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-09 15:25:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-11-09 15:25:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-09 15:25:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-11-09 15:25:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-09 15:25:14,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-09 15:25:14,136 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-09 15:25:14,136 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:25:14,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-11-09 15:25:14,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:14,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:14,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:14,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:14,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:14,139 INFO L745 eck$LassoCheckResult]: Stem: 478#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 466#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 467#L551 assume !(main_~length~0#1 < 1); 472#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 470#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 471#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 461#L556 assume !(main_~val~0#1 < 0); 462#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 463#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 477#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 468#L554-4 main_~j~0#1 := 0; 469#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 476#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 481#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 464#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 465#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 474#L562-3 [2024-11-09 15:25:14,139 INFO L747 eck$LassoCheckResult]: Loop: 474#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 473#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 474#L562-3 [2024-11-09 15:25:14,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2024-11-09 15:25:14,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:14,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501913334] [2024-11-09 15:25:14,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:14,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:14,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501913334] [2024-11-09 15:25:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501913334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055935654] [2024-11-09 15:25:14,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:14,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:14,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:14,276 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:14,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 15:25:14,326 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:25:14,326 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:14,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:25:14,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:14,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055935654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:14,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:14,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 15:25:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286605679] [2024-11-09 15:25:14,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:14,444 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:14,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2024-11-09 15:25:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:14,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54996676] [2024-11-09 15:25:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:14,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:25:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:25:14,498 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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-11-09 15:25:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:14,605 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-09 15:25:14,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-11-09 15:25:14,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:14,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 28 states and 35 transitions. [2024-11-09 15:25:14,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:14,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:14,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2024-11-09 15:25:14,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:14,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 15:25:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2024-11-09 15:25:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-09 15:25:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-09 15:25:14,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-09 15:25:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:25:14,613 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-09 15:25:14,614 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:25:14,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-11-09 15:25:14,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:14,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:14,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:14,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:14,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:14,616 INFO L745 eck$LassoCheckResult]: Stem: 655#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 643#L551 assume !(main_~length~0#1 < 1); 648#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 646#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 647#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 656#L556 assume !(main_~val~0#1 < 0); 661#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 653#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 654#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 637#L556 assume !(main_~val~0#1 < 0); 638#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 639#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 660#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 644#L554-4 main_~j~0#1 := 0; 645#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 652#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 659#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 640#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 641#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 650#L562-3 [2024-11-09 15:25:14,616 INFO L747 eck$LassoCheckResult]: Loop: 650#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 649#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 650#L562-3 [2024-11-09 15:25:14,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2024-11-09 15:25:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:14,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780368922] [2024-11-09 15:25:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:14,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2024-11-09 15:25:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080767989] [2024-11-09 15:25:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:14,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2024-11-09 15:25:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765757741] [2024-11-09 15:25:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:14,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:14,983 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:14,983 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:14,983 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:14,983 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:14,984 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:14,984 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:14,984 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:14,984 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:14,984 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration7_Lasso [2024-11-09 15:25:14,984 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:14,984 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:14,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:14,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:15,338 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:15,338 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:15,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:15,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:15,340 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:15,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:25:15,346 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-11-09 15:25:15,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:15,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:15,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:15,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:15,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:15,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:15,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:15,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:15,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:25:15,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:15,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:15,378 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:15,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:25:15,381 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-11-09 15:25:15,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:15,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:15,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:15,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:15,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:15,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:15,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:15,417 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:25:15,417 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:25:15,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:15,420 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:25:15,423 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:15,437 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:15,437 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:15,437 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2024-11-09 15:25:15,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:15,467 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:25:15,469 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:15,469 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:15,469 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:15,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:15,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:15,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:15,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:15,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:15,637 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:25:15,638 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:15,664 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-11-09 15:25:15,665 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-11-09 15:25:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:25:15,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-09 15:25:15,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:15,666 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:15,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:15,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:15,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:15,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:15,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:15,820 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:25:15,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:15,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-11-09 15:25:15,848 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-11-09 15:25:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:25:15,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-09 15:25:15,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:15,849 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:15,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:15,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:15,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:15,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:15,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:16,013 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 2 loop predicates [2024-11-09 15:25:16,013 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:16,084 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 50 transitions. Complement of second has 11 states. [2024-11-09 15:25:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2024-11-09 15:25:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-09 15:25:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 22 letters. Loop has 2 letters. [2024-11-09 15:25:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-09 15:25:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:16,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2024-11-09 15:25:16,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:16,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 43 transitions. [2024-11-09 15:25:16,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:16,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:16,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2024-11-09 15:25:16,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:16,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-09 15:25:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2024-11-09 15:25:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-11-09 15:25:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-09 15:25:16,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 15:25:16,090 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 15:25:16,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:25:16,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2024-11-09 15:25:16,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:16,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:16,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:16,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:16,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:16,092 INFO L745 eck$LassoCheckResult]: Stem: 1056#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1045#L551 assume !(main_~length~0#1 < 1); 1054#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1048#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1049#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1039#L556 assume !(main_~val~0#1 < 0); 1040#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1041#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1055#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1057#L556 assume !(main_~val~0#1 < 0); 1064#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1063#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1062#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 1046#L554-4 main_~j~0#1 := 0; 1047#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1058#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1066#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1065#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1059#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1053#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1068#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1042#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1043#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1051#L562-3 [2024-11-09 15:25:16,092 INFO L747 eck$LassoCheckResult]: Loop: 1051#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1050#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1051#L562-3 [2024-11-09 15:25:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1808436561, now seen corresponding path program 4 times [2024-11-09 15:25:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:16,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980087503] [2024-11-09 15:25:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980087503] [2024-11-09 15:25:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980087503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626697726] [2024-11-09 15:25:16,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:25:16,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:16,188 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:16,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 15:25:16,233 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:25:16,233 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:16,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:25:16,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:16,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:25:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:16,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626697726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:16,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-09 15:25:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491200555] [2024-11-09 15:25:16,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:16,413 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:16,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 4 times [2024-11-09 15:25:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:16,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346656535] [2024-11-09 15:25:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:16,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:16,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:25:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:25:16,458 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 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-11-09 15:25:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:16,532 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-11-09 15:25:16,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2024-11-09 15:25:16,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:16,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 46 transitions. [2024-11-09 15:25:16,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:16,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:16,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2024-11-09 15:25:16,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:16,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-09 15:25:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2024-11-09 15:25:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-09 15:25:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 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-11-09 15:25:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-09 15:25:16,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-09 15:25:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 15:25:16,537 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-09 15:25:16,537 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:25:16,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2024-11-09 15:25:16,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:16,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:16,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:16,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:16,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:16,538 INFO L745 eck$LassoCheckResult]: Stem: 1290#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1279#L551 assume !(main_~length~0#1 < 1); 1284#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1282#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1283#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1291#L556 assume !(main_~val~0#1 < 0); 1306#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1305#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1292#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1273#L556 assume !(main_~val~0#1 < 0); 1274#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1275#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1289#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1298#L556 assume !(main_~val~0#1 < 0); 1304#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1299#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1297#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 1280#L554-4 main_~j~0#1 := 0; 1281#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1293#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1301#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1300#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1294#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1288#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1303#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1276#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1277#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1286#L562-3 [2024-11-09 15:25:16,538 INFO L747 eck$LassoCheckResult]: Loop: 1286#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1285#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1286#L562-3 [2024-11-09 15:25:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash -759828824, now seen corresponding path program 5 times [2024-11-09 15:25:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:16,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091799336] [2024-11-09 15:25:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:16,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 5 times [2024-11-09 15:25:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:16,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941074429] [2024-11-09 15:25:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:16,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -51058003, now seen corresponding path program 2 times [2024-11-09 15:25:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998389491] [2024-11-09 15:25:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:16,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:17,072 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:17,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:17,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:17,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:17,072 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:17,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:17,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:17,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration9_Lasso [2024-11-09 15:25:17,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:17,072 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:17,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:17,525 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:17,525 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:17,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,527 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:25:17,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:17,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 15:25:17,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,552 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:25:17,554 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-11-09 15:25:17,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:25:17,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,582 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:25:17,586 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-11-09 15:25:17,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:17,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,614 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:25:17,616 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-11-09 15:25:17,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:25:17,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,639 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:25:17,641 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-11-09 15:25:17,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:17,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,664 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:25:17,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-11-09 15:25:17,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:17,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,694 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:25:17,696 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-11-09 15:25:17,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:17,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:17,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-09 15:25:17,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,724 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:25:17,725 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-11-09 15:25:17,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:17,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:17,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-09 15:25:17,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,751 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:25:17,752 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-11-09 15:25:17,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:17,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,776 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:25:17,778 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-11-09 15:25:17,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:17,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,802 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:25:17,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:17,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 15:25:17,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,827 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:25:17,829 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-11-09 15:25:17,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:17,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,852 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:25:17,854 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-11-09 15:25:17,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:17,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:17,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:17,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:17,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,876 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 15:25:17,877 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-11-09 15:25:17,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:17,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:17,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-09 15:25:17,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,908 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:25:17,909 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-11-09 15:25:17,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:17,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:17,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-09 15:25:17,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,935 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:25:17,936 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-11-09 15:25:17,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:17,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:17,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:17,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-09 15:25:17,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:17,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:17,968 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:17,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-09 15:25:17,970 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-11-09 15:25:17,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:17,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:17,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:17,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:17,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:17,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:17,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:18,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:18,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:18,006 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 15:25:18,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-11-09 15:25:18,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:18,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:18,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:18,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:18,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:18,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:18,028 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:18,045 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:25:18,045 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:25:18,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:18,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:18,047 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:18,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:25:18,050 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:18,063 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:18,064 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:18,064 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2024-11-09 15:25:18,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:18,086 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-11-09 15:25:18,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:18,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:18,088 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:18,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:18,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:25:18,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:18,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:18,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:18,226 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:25:18,226 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:18,248 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-11-09 15:25:18,248 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-11-09 15:25:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:18,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-11-09 15:25:18,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:18,249 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:18,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:25:18,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:18,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:18,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:18,390 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:25:18,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:18,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-11-09 15:25:18,410 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-11-09 15:25:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:18,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-11-09 15:25:18,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:18,411 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:18,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:18,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:25:18,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:18,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:18,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:18,541 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 2 loop predicates [2024-11-09 15:25:18,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:18,611 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 63 transitions. Complement of second has 12 states. [2024-11-09 15:25:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2024-11-09 15:25:18,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 2 letters. [2024-11-09 15:25:18,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:18,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 30 letters. Loop has 2 letters. [2024-11-09 15:25:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:18,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-09 15:25:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:18,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 63 transitions. [2024-11-09 15:25:18,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:18,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 56 transitions. [2024-11-09 15:25:18,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:18,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:18,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2024-11-09 15:25:18,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:18,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-09 15:25:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2024-11-09 15:25:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-09 15:25:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 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-11-09 15:25:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-11-09 15:25:18,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-09 15:25:18,618 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-09 15:25:18,618 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:25:18,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2024-11-09 15:25:18,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:18,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:18,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:18,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:18,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:18,620 INFO L745 eck$LassoCheckResult]: Stem: 1799#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1789#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1790#L551 assume !(main_~length~0#1 < 1); 1797#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1791#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1792#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1782#L556 assume !(main_~val~0#1 < 0); 1783#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1784#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1798#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1800#L556 assume !(main_~val~0#1 < 0); 1810#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1809#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1808#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1805#L556 assume !(main_~val~0#1 < 0); 1807#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1806#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1804#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 1787#L554-4 main_~j~0#1 := 0; 1788#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1796#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1813#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1785#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1786#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1801#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1819#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1818#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1817#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1816#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1814#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1812#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1811#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1794#L562-3 [2024-11-09 15:25:18,620 INFO L747 eck$LassoCheckResult]: Loop: 1794#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1793#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1794#L562-3 [2024-11-09 15:25:18,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1822100739, now seen corresponding path program 6 times [2024-11-09 15:25:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:18,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030829973] [2024-11-09 15:25:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:18,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-09 15:25:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:18,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030829973] [2024-11-09 15:25:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030829973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401018540] [2024-11-09 15:25:18,762 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:25:18,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:18,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:18,764 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:18,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-09 15:25:18,826 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-09 15:25:18,826 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:18,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:18,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:18,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401018540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:19,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:19,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-09 15:25:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430490413] [2024-11-09 15:25:19,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:19,029 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 6 times [2024-11-09 15:25:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145201461] [2024-11-09 15:25:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 15:25:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-09 15:25:19,071 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 15 Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:19,156 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-09 15:25:19,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-11-09 15:25:19,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:19,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 46 states and 57 transitions. [2024-11-09 15:25:19,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:19,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:19,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2024-11-09 15:25:19,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:19,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-09 15:25:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2024-11-09 15:25:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-11-09 15:25:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-11-09 15:25:19,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-09 15:25:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:25:19,168 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-09 15:25:19,168 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:25:19,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2024-11-09 15:25:19,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:19,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:19,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:19,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:19,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:19,169 INFO L745 eck$LassoCheckResult]: Stem: 2109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2098#L551 assume !(main_~length~0#1 < 1); 2105#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2099#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2100#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2108#L556 assume !(main_~val~0#1 < 0); 2130#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2106#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2107#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2090#L556 assume !(main_~val~0#1 < 0); 2091#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2092#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2127#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2126#L556 assume !(main_~val~0#1 < 0); 2125#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2124#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2123#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2114#L556 assume !(main_~val~0#1 < 0); 2119#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2116#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2113#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 2095#L554-4 main_~j~0#1 := 0; 2096#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2110#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2120#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2121#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2128#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2129#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2131#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2093#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2094#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2104#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2118#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2117#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2115#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2102#L562-3 [2024-11-09 15:25:19,169 INFO L747 eck$LassoCheckResult]: Loop: 2102#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2101#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2102#L562-3 [2024-11-09 15:25:19,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1774872054, now seen corresponding path program 7 times [2024-11-09 15:25:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:19,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390023508] [2024-11-09 15:25:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 7 times [2024-11-09 15:25:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570555521] [2024-11-09 15:25:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 550028923, now seen corresponding path program 3 times [2024-11-09 15:25:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448749576] [2024-11-09 15:25:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:19,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:19,876 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:19,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:19,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:19,877 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:19,877 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:19,877 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:19,877 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:19,877 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:19,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration11_Lasso [2024-11-09 15:25:19,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:19,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:19,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:19,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:20,272 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:20,272 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:20,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,274 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,278 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-11-09 15:25:20,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:25:20,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,308 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:25:20,310 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-11-09 15:25:20,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,344 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 15:25:20,348 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-11-09 15:25:20,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-09 15:25:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,376 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:25:20,378 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-11-09 15:25:20,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-09 15:25:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,405 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-09 15:25:20,406 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-11-09 15:25:20,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:20,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:20,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:20,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,431 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-09 15:25:20,432 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-11-09 15:25:20,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-09 15:25:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,454 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-09 15:25:20,455 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-11-09 15:25:20,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:20,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:20,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-09 15:25:20,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,501 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-09 15:25:20,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:20,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-09 15:25:20,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,524 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-09 15:25:20,525 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-11-09 15:25:20,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-09 15:25:20,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,548 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-09 15:25:20,550 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-11-09 15:25:20,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-09 15:25:20,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,572 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-09 15:25:20,573 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-11-09 15:25:20,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:20,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,595 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-09 15:25:20,597 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-11-09 15:25:20,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-09 15:25:20,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,620 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-09 15:25:20,621 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-11-09 15:25:20,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:20,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:20,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:20,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-09 15:25:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,643 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-09 15:25:20,644 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-11-09 15:25:20,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:20,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:20,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-09 15:25:20,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,668 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-09 15:25:20,670 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-11-09 15:25:20,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:20,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:20,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-09 15:25:20,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,707 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-09 15:25:20,709 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-11-09 15:25:20,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:20,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:20,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:20,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,735 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-09 15:25:20,736 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-11-09 15:25:20,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:20,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:20,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:20,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:20,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,774 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-09 15:25:20,777 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-11-09 15:25:20,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:20,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:20,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:20,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:20,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:20,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:20,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:20,804 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:25:20,804 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:25:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:20,805 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-09 15:25:20,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:20,817 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:20,817 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:20,817 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2024-11-09 15:25:20,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:20,838 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-11-09 15:25:20,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:20,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:20,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:20,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:20,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:20,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:20,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:20,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:21,004 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-09 15:25:21,004 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 15:25:21,027 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 44 states and 55 transitions. Complement of second has 4 states. [2024-11-09 15:25:21,029 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-11-09 15:25:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 15:25:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:21,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-11-09 15:25:21,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:21,030 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:21,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:21,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:21,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:21,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:21,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:21,185 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-09 15:25:21,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 15:25:21,207 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 44 states and 55 transitions. Complement of second has 4 states. [2024-11-09 15:25:21,207 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-11-09 15:25:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 15:25:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:21,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-11-09 15:25:21,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:21,208 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:21,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:21,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:21,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:21,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:21,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:21,334 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-09 15:25:21,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 15:25:21,413 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 76 transitions. Complement of second has 14 states. [2024-11-09 15:25:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11-09 15:25:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2024-11-09 15:25:21,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 2 letters. [2024-11-09 15:25:21,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:21,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 38 letters. Loop has 2 letters. [2024-11-09 15:25:21,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:21,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 4 letters. [2024-11-09 15:25:21,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:21,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2024-11-09 15:25:21,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:21,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 55 states and 69 transitions. [2024-11-09 15:25:21,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:21,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:21,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2024-11-09 15:25:21,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:21,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-11-09 15:25:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2024-11-09 15:25:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-11-09 15:25:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 47 states have internal predecessors, (59), 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-11-09 15:25:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-09 15:25:21,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-09 15:25:21,419 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-09 15:25:21,419 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:25:21,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2024-11-09 15:25:21,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:21,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:21,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:21,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:21,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:21,421 INFO L745 eck$LassoCheckResult]: Stem: 2736#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2723#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2724#L551 assume !(main_~length~0#1 < 1); 2733#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2727#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2728#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2737#L556 assume !(main_~val~0#1 < 0); 2749#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2734#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2735#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2718#L556 assume !(main_~val~0#1 < 0); 2719#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2720#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2748#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2747#L556 assume !(main_~val~0#1 < 0); 2746#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2745#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2744#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2741#L556 assume !(main_~val~0#1 < 0); 2743#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2742#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2740#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 2725#L554-4 main_~j~0#1 := 0; 2726#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2732#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2739#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2721#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2722#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2738#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2764#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2763#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2762#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2760#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2759#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2758#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2757#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2756#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2753#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2752#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2750#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2730#L562-3 [2024-11-09 15:25:21,421 INFO L747 eck$LassoCheckResult]: Loop: 2730#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2729#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2730#L562-3 [2024-11-09 15:25:21,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 296817483, now seen corresponding path program 8 times [2024-11-09 15:25:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:21,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004618815] [2024-11-09 15:25:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:21,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004618815] [2024-11-09 15:25:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004618815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:21,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059107221] [2024-11-09 15:25:21,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:21,620 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:21,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-11-09 15:25:21,675 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:25:21,675 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:21,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:25:21,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:21,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:21,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059107221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:21,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:21,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-11-09 15:25:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301079947] [2024-11-09 15:25:21,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:21,888 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:21,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 8 times [2024-11-09 15:25:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147027091] [2024-11-09 15:25:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:21,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:21,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 15:25:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-09 15:25:21,929 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. cyclomatic complexity: 18 Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 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-11-09 15:25:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:22,050 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-11-09 15:25:22,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 94 transitions. [2024-11-09 15:25:22,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:22,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 55 states and 68 transitions. [2024-11-09 15:25:22,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:22,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:22,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. [2024-11-09 15:25:22,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:22,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-11-09 15:25:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. [2024-11-09 15:25:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-09 15:25:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 51 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-11-09 15:25:22,054 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-09 15:25:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:25:22,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-09 15:25:22,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:25:22,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 64 transitions. [2024-11-09 15:25:22,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:22,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:22,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:22,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:22,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:22,057 INFO L745 eck$LassoCheckResult]: Stem: 3117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3106#L551 assume !(main_~length~0#1 < 1); 3115#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3109#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3110#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3100#L556 assume !(main_~val~0#1 < 0); 3101#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3102#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3116#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3118#L556 assume !(main_~val~0#1 < 0); 3151#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3150#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3149#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3148#L556 assume !(main_~val~0#1 < 0); 3147#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3146#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3145#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3144#L556 assume !(main_~val~0#1 < 0); 3143#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3142#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3141#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3122#L556 assume !(main_~val~0#1 < 0); 3128#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3125#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3121#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 3107#L554-4 main_~j~0#1 := 0; 3108#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3114#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3120#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3103#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3104#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3119#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3139#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3138#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3137#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3135#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3134#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3133#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3132#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3131#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3127#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3126#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3123#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3112#L562-3 [2024-11-09 15:25:22,057 INFO L747 eck$LassoCheckResult]: Loop: 3112#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3111#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3112#L562-3 [2024-11-09 15:25:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1662287172, now seen corresponding path program 9 times [2024-11-09 15:25:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003217914] [2024-11-09 15:25:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:22,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:22,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:22,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:22,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 9 times [2024-11-09 15:25:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:22,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737827634] [2024-11-09 15:25:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:22,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:22,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:22,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:22,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash -269860279, now seen corresponding path program 4 times [2024-11-09 15:25:22,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498363726] [2024-11-09 15:25:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:22,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:22,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:23,004 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:23,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:23,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:23,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:23,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:23,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:23,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:23,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration13_Lasso [2024-11-09 15:25:23,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:23,004 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:23,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:23,454 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:23,454 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:23,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,455 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-09 15:25:23,457 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-11-09 15:25:23,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:23,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:23,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:23,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-09 15:25:23,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,480 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-09 15:25:23,482 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-11-09 15:25:23,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:23,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:23,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:23,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-09 15:25:23,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,505 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-09 15:25:23,519 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-11-09 15:25:23,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:23,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:23,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:23,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-11-09 15:25:23,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,542 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-09 15:25:23,543 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-11-09 15:25:23,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:23,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:23,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-09 15:25:23,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,568 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-09 15:25:23,569 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-11-09 15:25:23,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:23,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:23,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:23,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,594 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-09 15:25:23,595 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-11-09 15:25:23,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:23,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:23,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:23,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-09 15:25:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,618 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-09 15:25:23,620 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-11-09 15:25:23,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:23,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:23,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:23,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-09 15:25:23,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,642 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-09 15:25:23,644 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-11-09 15:25:23,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:23,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:23,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:23,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,667 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-09 15:25:23,668 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-11-09 15:25:23,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:23,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:23,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:23,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-09 15:25:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,690 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-09 15:25:23,691 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-11-09 15:25:23,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:23,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:23,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:23,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,716 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-09 15:25:23,717 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-11-09 15:25:23,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:23,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:23,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:23,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,749 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-09 15:25:23,752 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-11-09 15:25:23,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:23,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:23,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:23,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,785 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-09 15:25:23,786 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-11-09 15:25:23,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:23,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:23,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:23,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-09 15:25:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,811 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-09 15:25:23,812 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-11-09 15:25:23,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:23,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:23,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:23,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:23,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:23,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:23,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:23,837 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 15:25:23,837 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:25:23,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:23,839 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:23,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-09 15:25:23,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:23,850 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:23,850 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:23,850 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-09 15:25:23,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-09 15:25:23,872 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-09 15:25:23,873 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:23,873 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:23,873 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:23,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:23,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:25:23,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:23,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:23,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:24,013 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-09 15:25:24,013 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:24,038 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-11-09 15:25:24,039 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-11-09 15:25:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:24,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-09 15:25:24,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:24,040 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:24,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:24,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:25:24,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:24,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:24,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:24,206 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-09 15:25:24,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:24,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-11-09 15:25:24,231 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-11-09 15:25:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:24,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-09 15:25:24,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:24,231 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:24,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:25:24,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:24,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:24,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:24,387 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-09 15:25:24,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:24,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 89 transitions. Complement of second has 16 states. [2024-11-09 15:25:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2024-11-09 15:25:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-09 15:25:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 46 letters. Loop has 2 letters. [2024-11-09 15:25:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-09 15:25:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:24,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 89 transitions. [2024-11-09 15:25:24,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:24,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 65 states and 82 transitions. [2024-11-09 15:25:24,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:24,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:24,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 82 transitions. [2024-11-09 15:25:24,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:24,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 82 transitions. [2024-11-09 15:25:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 82 transitions. [2024-11-09 15:25:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2024-11-09 15:25:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 56 states have internal predecessors, (70), 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-11-09 15:25:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-11-09 15:25:24,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-11-09 15:25:24,487 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-11-09 15:25:24,487 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 15:25:24,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 70 transitions. [2024-11-09 15:25:24,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:24,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:24,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:24,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:24,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:24,488 INFO L745 eck$LassoCheckResult]: Stem: 3865#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3853#L551 assume !(main_~length~0#1 < 1); 3862#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3856#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3857#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3866#L556 assume !(main_~val~0#1 < 0); 3883#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3863#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3864#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3847#L556 assume !(main_~val~0#1 < 0); 3848#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3849#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3882#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3881#L556 assume !(main_~val~0#1 < 0); 3880#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3879#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3878#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3877#L556 assume !(main_~val~0#1 < 0); 3876#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3875#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3874#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3871#L556 assume !(main_~val~0#1 < 0); 3873#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3872#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3870#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 3854#L554-4 main_~j~0#1 := 0; 3855#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3867#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3902#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3901#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3868#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3861#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3869#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3850#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3851#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3899#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3898#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3897#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3896#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3894#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3893#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3892#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3891#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3890#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3887#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3886#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3884#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3859#L562-3 [2024-11-09 15:25:24,488 INFO L747 eck$LassoCheckResult]: Loop: 3859#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3858#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3859#L562-3 [2024-11-09 15:25:24,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1637690471, now seen corresponding path program 10 times [2024-11-09 15:25:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428539866] [2024-11-09 15:25:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:24,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-09 15:25:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428539866] [2024-11-09 15:25:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428539866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780604991] [2024-11-09 15:25:24,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:25:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:24,731 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:24,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-11-09 15:25:24,792 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:25:24,792 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:24,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:25:24,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:24,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780604991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:25,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2024-11-09 15:25:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100308941] [2024-11-09 15:25:25,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:25,093 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:25,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 10 times [2024-11-09 15:25:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:25,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139051039] [2024-11-09 15:25:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:25,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 15:25:25,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-09 15:25:25,136 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. cyclomatic complexity: 21 Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 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-11-09 15:25:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:25,258 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-09 15:25:25,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 111 transitions. [2024-11-09 15:25:25,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:25,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 64 states and 79 transitions. [2024-11-09 15:25:25,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:25,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:25,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2024-11-09 15:25:25,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:25,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-11-09 15:25:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2024-11-09 15:25:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-11-09 15:25:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 60 states have internal predecessors, (75), 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-11-09 15:25:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-11-09 15:25:25,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-09 15:25:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 15:25:25,268 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-09 15:25:25,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-09 15:25:25,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2024-11-09 15:25:25,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:25,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:25,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:25,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:25,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:25,270 INFO L745 eck$LassoCheckResult]: Stem: 4321#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 4311#L551 assume !(main_~length~0#1 < 1); 4318#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 4312#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4313#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4303#L556 assume !(main_~val~0#1 < 0); 4304#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4305#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4319#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4320#L556 assume !(main_~val~0#1 < 0); 4363#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4362#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4361#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4360#L556 assume !(main_~val~0#1 < 0); 4359#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4358#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4357#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4356#L556 assume !(main_~val~0#1 < 0); 4355#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4354#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4353#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4352#L556 assume !(main_~val~0#1 < 0); 4351#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4350#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4349#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4326#L556 assume !(main_~val~0#1 < 0); 4332#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4329#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4325#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 4308#L554-4 main_~j~0#1 := 0; 4309#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4322#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4323#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4306#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4307#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4317#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4348#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4347#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4346#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4344#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4343#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4342#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4341#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4339#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4338#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4337#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4336#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4335#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4331#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4330#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4327#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4315#L562-3 [2024-11-09 15:25:25,270 INFO L747 eck$LassoCheckResult]: Loop: 4315#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4314#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4315#L562-3 [2024-11-09 15:25:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 618476690, now seen corresponding path program 11 times [2024-11-09 15:25:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522613190] [2024-11-09 15:25:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:25,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 11 times [2024-11-09 15:25:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443321835] [2024-11-09 15:25:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:25,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1650613783, now seen corresponding path program 5 times [2024-11-09 15:25:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383891138] [2024-11-09 15:25:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:25,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:26,694 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:26,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:26,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:26,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:26,694 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:26,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:26,694 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:26,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:26,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration15_Lasso [2024-11-09 15:25:26,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:26,695 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:26,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:26,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:27,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:27,408 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:27,409 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:27,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,413 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-09 15:25:27,414 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-11-09 15:25:27,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-09 15:25:27,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,441 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-09 15:25:27,442 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-11-09 15:25:27,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-09 15:25:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,465 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-09 15:25:27,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:27,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-09 15:25:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,488 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-09 15:25:27,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:27,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,512 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-09 15:25:27,513 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-11-09 15:25:27,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-09 15:25:27,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,539 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-09 15:25:27,540 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-11-09 15:25:27,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,562 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-09 15:25:27,564 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-11-09 15:25:27,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:27,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,587 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-09 15:25:27,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:27,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-09 15:25:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,611 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-09 15:25:27,613 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-11-09 15:25:27,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:27,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,635 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-09 15:25:27,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-11-09 15:25:27,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-09 15:25:27,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,661 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-09 15:25:27,662 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-11-09 15:25:27,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-09 15:25:27,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,685 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-09 15:25:27,687 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-11-09 15:25:27,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-11-09 15:25:27,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,710 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-09 15:25:27,711 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-11-09 15:25:27,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:27,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:27,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:27,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:27,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,756 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-09 15:25:27,757 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-11-09 15:25:27,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-09 15:25:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,784 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-09 15:25:27,786 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-11-09 15:25:27,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-09 15:25:27,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,814 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-09 15:25:27,815 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-11-09 15:25:27,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:27,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,844 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-09 15:25:27,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-11-09 15:25:27,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:27,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,873 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-09 15:25:27,875 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-11-09 15:25:27,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-09 15:25:27,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,903 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-09 15:25:27,905 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-11-09 15:25:27,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-09 15:25:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,929 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-09 15:25:27,930 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-11-09 15:25:27,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:27,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-11-09 15:25:27,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:27,966 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:27,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-09 15:25:27,967 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-11-09 15:25:27,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:27,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:27,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:27,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:27,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:27,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:27,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:28,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-09 15:25:28,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:28,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:28,003 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:28,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-09 15:25:28,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:28,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:28,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:28,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:28,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:28,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:28,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:28,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:28,029 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-09 15:25:28,029 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-09 15:25:28,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:28,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:28,031 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:28,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-09 15:25:28,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:28,042 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:28,042 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:28,042 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1 Supporting invariants [] [2024-11-09 15:25:28,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:28,110 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2024-11-09 15:25:28,112 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:28,113 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:28,113 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:28,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:28,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:28,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:25:28,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:28,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:28,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:28,421 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-09 15:25:28,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-11-09 15:25:28,458 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 62 states and 77 transitions. Complement of second has 5 states. [2024-11-09 15:25:28,458 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-11-09 15:25:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-11-09 15:25:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:25:28,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-11-09 15:25:28,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:28,459 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:28,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:28,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:25:28,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:28,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:28,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:28,740 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-09 15:25:28,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-11-09 15:25:28,771 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 62 states and 77 transitions. Complement of second has 5 states. [2024-11-09 15:25:28,771 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-11-09 15:25:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-11-09 15:25:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:25:28,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-11-09 15:25:28,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:28,772 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:28,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:28,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:25:28,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:29,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:29,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:29,079 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-09 15:25:29,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-11-09 15:25:29,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 80 states and 102 transitions. Complement of second has 19 states. [2024-11-09 15:25:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-11-09 15:25:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2024-11-09 15:25:29,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 2 letters. [2024-11-09 15:25:29,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:29,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 54 letters. Loop has 2 letters. [2024-11-09 15:25:29,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:29,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 4 letters. [2024-11-09 15:25:29,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:29,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2024-11-09 15:25:29,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:29,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 75 states and 95 transitions. [2024-11-09 15:25:29,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:29,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:29,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 95 transitions. [2024-11-09 15:25:29,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:29,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 95 transitions. [2024-11-09 15:25:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 95 transitions. [2024-11-09 15:25:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2024-11-09 15:25:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 65 states have internal predecessors, (81), 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-11-09 15:25:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-09 15:25:29,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-09 15:25:29,212 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-09 15:25:29,213 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-09 15:25:29,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 81 transitions. [2024-11-09 15:25:29,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:29,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:29,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:29,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:29,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:29,214 INFO L745 eck$LassoCheckResult]: Stem: 5258#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5247#L551 assume !(main_~length~0#1 < 1); 5252#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5250#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5251#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5241#L556 assume !(main_~val~0#1 < 0); 5242#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5243#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5257#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5259#L556 assume !(main_~val~0#1 < 0); 5281#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5280#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5279#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5278#L556 assume !(main_~val~0#1 < 0); 5277#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5276#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5275#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5274#L556 assume !(main_~val~0#1 < 0); 5273#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5272#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5271#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5270#L556 assume !(main_~val~0#1 < 0); 5269#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5268#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5267#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5264#L556 assume !(main_~val~0#1 < 0); 5266#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5265#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5263#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 5248#L554-4 main_~j~0#1 := 0; 5249#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5260#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5305#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5304#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5261#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5256#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5262#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5244#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5245#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5302#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5301#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5300#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5299#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5297#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5296#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5295#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5294#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5292#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5291#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5290#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5289#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5288#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5285#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5284#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5282#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5254#L562-3 [2024-11-09 15:25:29,214 INFO L747 eck$LassoCheckResult]: Loop: 5254#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5253#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5254#L562-3 [2024-11-09 15:25:29,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1396913127, now seen corresponding path program 12 times [2024-11-09 15:25:29,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:29,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372604375] [2024-11-09 15:25:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:29,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372604375] [2024-11-09 15:25:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372604375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967654836] [2024-11-09 15:25:29,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:25:29,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:29,460 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:29,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2024-11-09 15:25:29,534 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-09 15:25:29,534 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:29,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:25:29,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:29,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967654836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:29,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:29,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2024-11-09 15:25:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278168836] [2024-11-09 15:25:29,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:29,875 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:29,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 12 times [2024-11-09 15:25:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711748455] [2024-11-09 15:25:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:29,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:29,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 15:25:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-11-09 15:25:29,917 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. cyclomatic complexity: 24 Second operand has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:30,056 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2024-11-09 15:25:30,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 128 transitions. [2024-11-09 15:25:30,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:30,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 73 states and 90 transitions. [2024-11-09 15:25:30,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:30,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:30,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 90 transitions. [2024-11-09 15:25:30,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:30,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-11-09 15:25:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 90 transitions. [2024-11-09 15:25:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-09 15:25:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2024-11-09 15:25:30,066 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-11-09 15:25:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 15:25:30,067 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-11-09 15:25:30,067 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-09 15:25:30,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 86 transitions. [2024-11-09 15:25:30,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:30,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:30,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:30,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:30,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:30,069 INFO L745 eck$LassoCheckResult]: Stem: 5788#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5776#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5777#L551 assume !(main_~length~0#1 < 1); 5786#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5780#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5781#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5771#L556 assume !(main_~val~0#1 < 0); 5772#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5773#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5787#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5789#L556 assume !(main_~val~0#1 < 0); 5840#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5839#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5838#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5837#L556 assume !(main_~val~0#1 < 0); 5836#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5835#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5834#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5833#L556 assume !(main_~val~0#1 < 0); 5832#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5831#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5830#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5829#L556 assume !(main_~val~0#1 < 0); 5828#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5827#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5826#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5825#L556 assume !(main_~val~0#1 < 0); 5824#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5823#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5822#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5794#L556 assume !(main_~val~0#1 < 0); 5800#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5797#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5793#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 5778#L554-4 main_~j~0#1 := 0; 5779#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5790#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5791#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5774#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5775#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5785#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5821#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5820#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5819#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5817#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5816#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5815#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5814#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5812#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5811#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5810#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5809#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5807#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5806#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5805#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5804#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5803#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5799#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5798#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5795#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5783#L562-3 [2024-11-09 15:25:30,069 INFO L747 eck$LassoCheckResult]: Loop: 5783#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5782#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5783#L562-3 [2024-11-09 15:25:30,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1611822112, now seen corresponding path program 13 times [2024-11-09 15:25:30,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:30,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785149160] [2024-11-09 15:25:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:30,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:30,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:30,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 13 times [2024-11-09 15:25:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:30,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531704130] [2024-11-09 15:25:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:30,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:30,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:30,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:30,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1522145765, now seen corresponding path program 6 times [2024-11-09 15:25:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116094126] [2024-11-09 15:25:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:30,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:30,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:33,481 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:33,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:33,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:33,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:33,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:33,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:33,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:33,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:33,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration17_Lasso [2024-11-09 15:25:33,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:33,482 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:33,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:33,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:34,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:34,786 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,788 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-11-09 15:25:34,791 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-11-09 15:25:34,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:34,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:34,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:34,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-11-09 15:25:34,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,815 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-09 15:25:34,817 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-11-09 15:25:34,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-09 15:25:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,845 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-09 15:25:34,846 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-11-09 15:25:34,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-09 15:25:34,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,875 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-09 15:25:34,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-11-09 15:25:34,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-11-09 15:25:34,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,903 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-11-09 15:25:34,906 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-11-09 15:25:34,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-11-09 15:25:34,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,935 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-09 15:25:34,936 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-11-09 15:25:34,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:34,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,963 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-09 15:25:34,964 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-11-09 15:25:34,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:34,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:34,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:34,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:34,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:34,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:34,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:34,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-11-09 15:25:34,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:34,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:34,990 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:34,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-09 15:25:34,992 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-11-09 15:25:35,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:35,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:35,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:35,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:35,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:35,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:35,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:35,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:35,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:35,019 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:35,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-11-09 15:25:35,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-11-09 15:25:35,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:35,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:35,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:35,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:35,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:35,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:35,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:35,044 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:25:35,044 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:25:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:35,045 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:35,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-11-09 15:25:35,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:35,059 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:35,059 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:35,060 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1 Supporting invariants [] [2024-11-09 15:25:35,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-11-09 15:25:35,114 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2024-11-09 15:25:35,116 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:35,116 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:35,116 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:35,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:35,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:25:35,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:35,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:35,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:35,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-09 15:25:35,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-11-09 15:25:35,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-11-09 15:25:35,347 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-11-09 15:25:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-11-09 15:25:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:35,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-11-09 15:25:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:35,348 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:35,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:35,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:25:35,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:35,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:35,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:35,558 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-09 15:25:35,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-11-09 15:25:35,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-11-09 15:25:35,578 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-11-09 15:25:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-11-09 15:25:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:35,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-11-09 15:25:35,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:35,579 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:35,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:35,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:25:35,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:35,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:35,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:35,781 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-09 15:25:35,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-11-09 15:25:35,909 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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) Result 90 states and 115 transitions. Complement of second has 20 states. [2024-11-09 15:25:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-11-09 15:25:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2024-11-09 15:25:35,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 2 letters. [2024-11-09 15:25:35,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:35,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 62 letters. Loop has 2 letters. [2024-11-09 15:25:35,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:35,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 4 letters. [2024-11-09 15:25:35,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:35,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2024-11-09 15:25:35,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:35,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 85 states and 108 transitions. [2024-11-09 15:25:35,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:35,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:35,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 108 transitions. [2024-11-09 15:25:35,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:35,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-11-09 15:25:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 108 transitions. [2024-11-09 15:25:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-11-09 15:25:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 74 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2024-11-09 15:25:35,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-11-09 15:25:35,915 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-11-09 15:25:35,915 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-09 15:25:35,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 92 transitions. [2024-11-09 15:25:35,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:35,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:35,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:35,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:35,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:35,920 INFO L745 eck$LassoCheckResult]: Stem: 6797#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 6786#L551 assume !(main_~length~0#1 < 1); 6791#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 6789#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6790#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6780#L556 assume !(main_~val~0#1 < 0); 6781#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6782#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6796#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6798#L556 assume !(main_~val~0#1 < 0); 6824#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6823#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6822#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6821#L556 assume !(main_~val~0#1 < 0); 6820#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6819#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6818#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6817#L556 assume !(main_~val~0#1 < 0); 6816#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6815#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6814#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6813#L556 assume !(main_~val~0#1 < 0); 6812#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6811#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6810#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6809#L556 assume !(main_~val~0#1 < 0); 6808#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6807#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6806#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6803#L556 assume !(main_~val~0#1 < 0); 6805#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6804#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6802#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 6787#L554-4 main_~j~0#1 := 0; 6788#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6799#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6853#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6852#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6800#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6795#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6801#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6783#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6784#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6850#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6849#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6848#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6847#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6845#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6844#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6843#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6842#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6840#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6839#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6838#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6837#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6835#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6834#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6833#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6832#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6831#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6828#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6827#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6825#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6793#L562-3 [2024-11-09 15:25:35,920 INFO L747 eck$LassoCheckResult]: Loop: 6793#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6792#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 6793#L562-3 [2024-11-09 15:25:35,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1801767883, now seen corresponding path program 14 times [2024-11-09 15:25:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:35,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490086246] [2024-11-09 15:25:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:36,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 66 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490086246] [2024-11-09 15:25:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490086246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324619727] [2024-11-09 15:25:36,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:36,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:36,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:36,250 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:36,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2024-11-09 15:25:36,339 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:25:36,339 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:36,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:25:36,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:36,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324619727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:36,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:36,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2024-11-09 15:25:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799092609] [2024-11-09 15:25:36,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:36,738 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 14 times [2024-11-09 15:25:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225112542] [2024-11-09 15:25:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:36,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:36,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:36,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 15:25:36,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2024-11-09 15:25:36,777 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 29 states have internal predecessors, (104), 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-11-09 15:25:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:36,937 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2024-11-09 15:25:36,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 145 transitions. [2024-11-09 15:25:36,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:36,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 82 states and 101 transitions. [2024-11-09 15:25:36,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:36,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:36,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 101 transitions. [2024-11-09 15:25:36,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:36,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-11-09 15:25:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 101 transitions. [2024-11-09 15:25:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-09 15:25:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 78 states have internal predecessors, (97), 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-11-09 15:25:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2024-11-09 15:25:36,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-11-09 15:25:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 15:25:36,943 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-11-09 15:25:36,944 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-09 15:25:36,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2024-11-09 15:25:36,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:36,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:36,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:36,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:36,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:36,945 INFO L745 eck$LassoCheckResult]: Stem: 7402#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 7392#L551 assume !(main_~length~0#1 < 1); 7399#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 7393#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 7394#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7384#L556 assume !(main_~val~0#1 < 0); 7385#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7386#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7400#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7401#L556 assume !(main_~val~0#1 < 0); 7462#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7461#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7460#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7459#L556 assume !(main_~val~0#1 < 0); 7458#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7457#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7456#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7455#L556 assume !(main_~val~0#1 < 0); 7454#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7453#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7452#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7451#L556 assume !(main_~val~0#1 < 0); 7450#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7449#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7448#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7447#L556 assume !(main_~val~0#1 < 0); 7446#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7445#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7444#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7443#L556 assume !(main_~val~0#1 < 0); 7442#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7441#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7440#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7407#L556 assume !(main_~val~0#1 < 0); 7413#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7410#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7406#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 7389#L554-4 main_~j~0#1 := 0; 7390#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7403#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7404#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7387#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7388#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7398#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7439#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7438#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7437#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7435#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7434#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7433#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7432#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7430#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7429#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7428#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7427#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7425#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7424#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7423#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7422#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7420#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7419#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7418#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7417#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7416#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7412#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7411#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7408#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7396#L562-3 [2024-11-09 15:25:36,945 INFO L747 eck$LassoCheckResult]: Loop: 7396#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7395#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 7396#L562-3 [2024-11-09 15:25:36,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash 260997934, now seen corresponding path program 15 times [2024-11-09 15:25:36,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:36,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528982540] [2024-11-09 15:25:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:36,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:36,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 15 times [2024-11-09 15:25:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024062417] [2024-11-09 15:25:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:37,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:37,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:37,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1710912947, now seen corresponding path program 7 times [2024-11-09 15:25:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:37,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660512609] [2024-11-09 15:25:37,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:37,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:37,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:40,146 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:40,146 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:40,146 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:40,146 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:40,146 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:40,146 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,146 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:40,146 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:40,146 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration19_Lasso [2024-11-09 15:25:40,146 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:40,146 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:40,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:40,676 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:40,677 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:40,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,679 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-09 15:25:40,680 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-11-09 15:25:40,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-11-09 15:25:40,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,703 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-09 15:25:40,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:40,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-11-09 15:25:40,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,726 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-09 15:25:40,727 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-11-09 15:25:40,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:40,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:40,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-09 15:25:40,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,753 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-09 15:25:40,754 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-11-09 15:25:40,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-11-09 15:25:40,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,777 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-09 15:25:40,778 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-11-09 15:25:40,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-09 15:25:40,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,802 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-09 15:25:40,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:40,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-09 15:25:40,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,828 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-09 15:25:40,830 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-11-09 15:25:40,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-11-09 15:25:40,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,853 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-09 15:25:40,854 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-11-09 15:25:40,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:40,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:40,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-09 15:25:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,879 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-11-09 15:25:40,880 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-11-09 15:25:40,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-11-09 15:25:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,903 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-09 15:25:40,904 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-11-09 15:25:40,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-11-09 15:25:40,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,927 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-09 15:25:40,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:40,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-11-09 15:25:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,950 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-11-09 15:25:40,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:40,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,973 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-11-09 15:25:40,974 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-11-09 15:25:40,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:40,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:40,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:40,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:40,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:40,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:40,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:40,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:40,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:40,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:40,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:40,996 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:40,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-11-09 15:25:40,998 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-11-09 15:25:41,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-11-09 15:25:41,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,022 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-11-09 15:25:41,024 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-11-09 15:25:41,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:41,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,048 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-11-09 15:25:41,049 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-11-09 15:25:41,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-11-09 15:25:41,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,074 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-11-09 15:25:41,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:41,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-11-09 15:25:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,099 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-11-09 15:25:41,100 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-11-09 15:25:41,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,125 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-11-09 15:25:41,126 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-11-09 15:25:41,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-11-09 15:25:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,152 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-11-09 15:25:41,153 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-11-09 15:25:41,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-11-09 15:25:41,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,177 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-11-09 15:25:41,178 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-11-09 15:25:41,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-11-09 15:25:41,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,208 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-11-09 15:25:41,209 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-11-09 15:25:41,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:41,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,235 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-11-09 15:25:41,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:41,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-11-09 15:25:41,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,261 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-11-09 15:25:41,262 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-11-09 15:25:41,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-09 15:25:41,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,286 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-09 15:25:41,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:25:41,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:41,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,311 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-09 15:25:41,312 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-11-09 15:25:41,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:41,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:41,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:41,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:41,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:41,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:41,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:41,342 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:25:41,342 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:25:41,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:41,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:41,344 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:41,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-11-09 15:25:41,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:41,358 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:41,359 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:41,359 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1 Supporting invariants [] [2024-11-09 15:25:41,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-11-09 15:25:41,385 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-11-09 15:25:41,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:41,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:41,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:41,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:41,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:25:41,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:41,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:41,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:41,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:41,751 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-09 15:25:41,751 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-11-09 15:25:41,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-11-09 15:25:41,792 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-11-09 15:25:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-11-09 15:25:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:25:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-09 15:25:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:41,793 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:41,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:41,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:25:41,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:42,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:42,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:42,161 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-09 15:25:42,161 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-11-09 15:25:42,199 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-11-09 15:25:42,200 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-11-09 15:25:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-11-09 15:25:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:25:42,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-09 15:25:42,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:42,201 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:42,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:25:42,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:42,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:42,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:42,632 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-09 15:25:42,633 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-11-09 15:25:42,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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) Result 100 states and 128 transitions. Complement of second has 23 states. [2024-11-09 15:25:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-11-09 15:25:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2024-11-09 15:25:42,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-09 15:25:42,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:42,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 70 letters. Loop has 2 letters. [2024-11-09 15:25:42,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:42,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 4 letters. [2024-11-09 15:25:42,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:42,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 128 transitions. [2024-11-09 15:25:42,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:42,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 95 states and 121 transitions. [2024-11-09 15:25:42,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:42,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:42,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 121 transitions. [2024-11-09 15:25:42,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:42,815 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 121 transitions. [2024-11-09 15:25:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 121 transitions. [2024-11-09 15:25:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2024-11-09 15:25:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 83 states have internal predecessors, (103), 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-11-09 15:25:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-11-09 15:25:42,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-09 15:25:42,817 INFO L425 stractBuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-09 15:25:42,817 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-09 15:25:42,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 103 transitions. [2024-11-09 15:25:42,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:42,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:42,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:42,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:42,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:42,819 INFO L745 eck$LassoCheckResult]: Stem: 8518#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 8506#L551 assume !(main_~length~0#1 < 1); 8515#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 8509#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 8510#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8519#L556 assume !(main_~val~0#1 < 0); 8548#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8516#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8517#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8500#L556 assume !(main_~val~0#1 < 0); 8501#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8502#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8547#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8546#L556 assume !(main_~val~0#1 < 0); 8545#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8544#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8543#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8542#L556 assume !(main_~val~0#1 < 0); 8541#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8540#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8539#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8538#L556 assume !(main_~val~0#1 < 0); 8537#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8536#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8535#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8534#L556 assume !(main_~val~0#1 < 0); 8533#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8532#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8531#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8530#L556 assume !(main_~val~0#1 < 0); 8529#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8528#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8527#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8524#L556 assume !(main_~val~0#1 < 0); 8526#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8525#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8523#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 8507#L554-4 main_~j~0#1 := 0; 8508#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8520#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8582#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8581#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8521#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8514#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8522#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8503#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8504#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8579#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8578#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8577#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8576#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8574#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8573#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8572#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8571#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8569#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8568#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8567#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8566#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8564#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8563#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8562#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8561#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8559#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8558#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8557#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8556#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8555#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8552#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8551#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8549#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8512#L562-3 [2024-11-09 15:25:42,819 INFO L747 eck$LassoCheckResult]: Loop: 8512#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8511#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 8512#L562-3 [2024-11-09 15:25:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash -785132413, now seen corresponding path program 16 times [2024-11-09 15:25:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940211410] [2024-11-09 15:25:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 91 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940211410] [2024-11-09 15:25:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940211410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399170050] [2024-11-09 15:25:43,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:25:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:43,164 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:43,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2024-11-09 15:25:43,267 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:25:43,267 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:43,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:25:43,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:43,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399170050] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:43,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:43,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2024-11-09 15:25:43,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542786728] [2024-11-09 15:25:43,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:43,763 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:43,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 16 times [2024-11-09 15:25:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51227841] [2024-11-09 15:25:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:43,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:43,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:43,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 15:25:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2024-11-09 15:25:43,804 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. cyclomatic complexity: 30 Second operand has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 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-11-09 15:25:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:44,000 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-11-09 15:25:44,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 162 transitions. [2024-11-09 15:25:44,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:44,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 91 states and 112 transitions. [2024-11-09 15:25:44,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:44,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:44,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 112 transitions. [2024-11-09 15:25:44,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:44,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-11-09 15:25:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 112 transitions. [2024-11-09 15:25:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-11-09 15:25:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 87 states have internal predecessors, (108), 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-11-09 15:25:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-09 15:25:44,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-09 15:25:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 15:25:44,006 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-09 15:25:44,006 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-09 15:25:44,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 108 transitions. [2024-11-09 15:25:44,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:44,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:44,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:44,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:44,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:44,008 INFO L745 eck$LassoCheckResult]: Stem: 9196#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 9186#L551 assume !(main_~length~0#1 < 1); 9193#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 9187#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 9188#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9178#L556 assume !(main_~val~0#1 < 0); 9179#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9180#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9194#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9195#L556 assume !(main_~val~0#1 < 0); 9265#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9264#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9263#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9262#L556 assume !(main_~val~0#1 < 0); 9261#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9260#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9259#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9258#L556 assume !(main_~val~0#1 < 0); 9257#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9256#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9255#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9254#L556 assume !(main_~val~0#1 < 0); 9253#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9252#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9251#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9250#L556 assume !(main_~val~0#1 < 0); 9249#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9248#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9247#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9246#L556 assume !(main_~val~0#1 < 0); 9245#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9244#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9243#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9242#L556 assume !(main_~val~0#1 < 0); 9241#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9240#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9239#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9201#L556 assume !(main_~val~0#1 < 0); 9207#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9204#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9200#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 9183#L554-4 main_~j~0#1 := 0; 9184#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9197#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9198#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9181#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9182#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9192#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9238#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9237#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9236#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9234#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9233#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9232#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9231#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9229#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9228#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9227#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9226#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9224#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9223#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9222#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9221#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9219#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9218#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9217#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9216#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9214#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9213#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9212#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9211#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9210#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9206#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9205#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9202#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9190#L562-3 [2024-11-09 15:25:44,008 INFO L747 eck$LassoCheckResult]: Loop: 9190#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9189#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 9190#L562-3 [2024-11-09 15:25:44,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:44,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1182197124, now seen corresponding path program 17 times [2024-11-09 15:25:44,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:44,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240955180] [2024-11-09 15:25:44,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:44,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:44,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:44,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:44,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:44,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 17 times [2024-11-09 15:25:44,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:44,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095924715] [2024-11-09 15:25:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:44,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:44,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2074898817, now seen corresponding path program 8 times [2024-11-09 15:25:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:44,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878662833] [2024-11-09 15:25:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:44,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:44,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:44,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:49,609 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:49,609 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:49,609 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:49,609 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:49,609 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:49,609 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:49,609 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:49,609 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:49,609 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration21_Lasso [2024-11-09 15:25:49,609 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:49,609 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:49,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:49,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:49,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:49,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:49,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:49,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:51,740 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:51,740 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:51,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,741 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-11-09 15:25:51,743 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-11-09 15:25:51,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:51,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:51,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:51,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-11-09 15:25:51,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,766 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-09 15:25:51,767 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-11-09 15:25:51,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:51,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:51,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:51,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-11-09 15:25:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,798 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-09 15:25:51,800 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-11-09 15:25:51,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:51,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:51,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-09 15:25:51,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,826 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-09 15:25:51,827 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-11-09 15:25:51,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:51,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:51,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:51,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-11-09 15:25:51,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,850 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-09 15:25:51,851 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-11-09 15:25:51,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:51,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:51,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:51,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-11-09 15:25:51,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,875 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-11-09 15:25:51,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-11-09 15:25:51,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:51,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:51,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-11-09 15:25:51,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,902 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-11-09 15:25:51,903 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-11-09 15:25:51,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:51,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:51,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:51,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,928 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-11-09 15:25:51,929 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-11-09 15:25:51,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:51,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:51,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-11-09 15:25:51,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,956 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-11-09 15:25:51,957 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-11-09 15:25:51,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:51,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:51,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:51,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:51,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-11-09 15:25:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:51,985 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:51,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-11-09 15:25:51,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-11-09 15:25:51,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:51,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:51,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:51,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:52,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:52,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:52,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:52,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-11-09 15:25:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:52,015 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:52,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-11-09 15:25:52,017 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-11-09 15:25:52,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:52,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:52,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:52,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:52,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:52,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:52,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:52,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-11-09 15:25:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:52,044 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:52,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-11-09 15:25:52,045 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-11-09 15:25:52,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:52,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:52,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:52,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:52,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:52,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:52,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:52,081 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-09 15:25:52,081 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:25:52,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:52,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:52,084 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:25:52,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-11-09 15:25:52,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:52,101 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:52,102 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:52,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-09 15:25:52,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-11-09 15:25:52,215 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-11-09 15:25:52,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:52,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:52,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:25:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:52,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:25:52,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:52,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-11-09 15:25:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:52,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:52,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:52,545 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-09 15:25:52,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-11-09 15:25:52,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 89 states and 110 transitions. Complement of second has 4 states. [2024-11-09 15:25:52,573 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-11-09 15:25:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-11-09 15:25:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:52,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-11-09 15:25:52,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:52,574 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:52,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:52,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:25:52,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:52,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:52,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:52,883 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-09 15:25:52,883 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-11-09 15:25:52,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 89 states and 110 transitions. Complement of second has 4 states. [2024-11-09 15:25:52,906 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-11-09 15:25:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-11-09 15:25:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:25:52,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-11-09 15:25:52,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:52,907 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:52,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:25:52,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:53,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:25:53,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:53,185 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-09 15:25:53,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-11-09 15:25:53,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 110 states and 141 transitions. Complement of second has 24 states. [2024-11-09 15:25:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:25:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-11-09 15:25:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2024-11-09 15:25:53,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 2 letters. [2024-11-09 15:25:53,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:53,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 78 letters. Loop has 2 letters. [2024-11-09 15:25:53,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:53,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 4 letters. [2024-11-09 15:25:53,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:53,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 141 transitions. [2024-11-09 15:25:53,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:53,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 105 states and 134 transitions. [2024-11-09 15:25:53,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:25:53,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:25:53,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 134 transitions. [2024-11-09 15:25:53,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:53,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 134 transitions. [2024-11-09 15:25:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 134 transitions. [2024-11-09 15:25:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-11-09 15:25:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 92 states have internal predecessors, (114), 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-11-09 15:25:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-11-09 15:25:53,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-11-09 15:25:53,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-11-09 15:25:53,381 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-09 15:25:53,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 114 transitions. [2024-11-09 15:25:53,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:53,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:53,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:53,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:53,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:53,382 INFO L745 eck$LassoCheckResult]: Stem: 10450#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 10439#L551 assume !(main_~length~0#1 < 1); 10444#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 10442#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 10443#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10433#L556 assume !(main_~val~0#1 < 0); 10434#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10435#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10449#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10451#L556 assume !(main_~val~0#1 < 0); 10485#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10484#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10483#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10482#L556 assume !(main_~val~0#1 < 0); 10481#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10480#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10479#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10478#L556 assume !(main_~val~0#1 < 0); 10477#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10476#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10475#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10474#L556 assume !(main_~val~0#1 < 0); 10473#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10472#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10471#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10470#L556 assume !(main_~val~0#1 < 0); 10469#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10468#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10467#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10466#L556 assume !(main_~val~0#1 < 0); 10465#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10464#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10463#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10462#L556 assume !(main_~val~0#1 < 0); 10461#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10460#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10459#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10456#L556 assume !(main_~val~0#1 < 0); 10458#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10457#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10455#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 10440#L554-4 main_~j~0#1 := 0; 10441#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10452#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10524#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10523#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10453#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10448#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10454#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10436#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10437#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10521#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10520#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10519#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10518#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10516#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10515#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10514#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10513#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10511#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10510#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10509#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10508#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10506#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10505#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10504#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10503#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10501#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10500#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10499#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10498#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10496#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10495#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10494#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10493#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10492#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10489#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10488#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10486#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10446#L562-3 [2024-11-09 15:25:53,382 INFO L747 eck$LassoCheckResult]: Loop: 10446#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10445#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 10446#L562-3 [2024-11-09 15:25:53,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1112937681, now seen corresponding path program 18 times [2024-11-09 15:25:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375472512] [2024-11-09 15:25:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375472512] [2024-11-09 15:25:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375472512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397658418] [2024-11-09 15:25:53,806 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:25:53,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:53,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:53,807 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:53,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2024-11-09 15:25:53,946 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-09 15:25:53,946 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:53,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:25:53,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:54,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397658418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:54,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2024-11-09 15:25:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676250562] [2024-11-09 15:25:54,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:54,501 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:54,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 18 times [2024-11-09 15:25:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025269739] [2024-11-09 15:25:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 15:25:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 15:25:54,534 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. cyclomatic complexity: 33 Second operand has 35 states, 34 states have (on average 3.764705882352941) internal successors, (128), 35 states have internal predecessors, (128), 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-11-09 15:25:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:54,686 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2024-11-09 15:25:54,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 179 transitions. [2024-11-09 15:25:54,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:54,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 100 states and 123 transitions. [2024-11-09 15:25:54,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:54,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:54,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 123 transitions. [2024-11-09 15:25:54,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:54,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-09 15:25:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 123 transitions. [2024-11-09 15:25:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-09 15:25:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 96 states have internal predecessors, (119), 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-11-09 15:25:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-11-09 15:25:54,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-11-09 15:25:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 15:25:54,690 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-11-09 15:25:54,690 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-09 15:25:54,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 119 transitions. [2024-11-09 15:25:54,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:54,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:54,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:54,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:25:54,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:54,692 INFO L745 eck$LassoCheckResult]: Stem: 11202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 11191#L551 assume !(main_~length~0#1 < 1); 11196#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11194#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 11195#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11185#L556 assume !(main_~val~0#1 < 0); 11186#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11187#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11201#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11203#L556 assume !(main_~val~0#1 < 0); 11281#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11280#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11279#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11278#L556 assume !(main_~val~0#1 < 0); 11277#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11276#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11275#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11274#L556 assume !(main_~val~0#1 < 0); 11273#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11272#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11271#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11270#L556 assume !(main_~val~0#1 < 0); 11269#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11268#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11267#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11266#L556 assume !(main_~val~0#1 < 0); 11265#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11264#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11263#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11262#L556 assume !(main_~val~0#1 < 0); 11261#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11260#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11259#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11258#L556 assume !(main_~val~0#1 < 0); 11257#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11256#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11255#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11254#L556 assume !(main_~val~0#1 < 0); 11253#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11252#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11251#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11208#L556 assume !(main_~val~0#1 < 0); 11214#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11211#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11207#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 11192#L554-4 main_~j~0#1 := 0; 11193#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11204#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11205#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11188#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11189#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11200#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11250#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11249#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11248#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11246#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11245#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11244#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11243#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11241#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11240#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11239#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11238#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11236#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11235#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11234#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11233#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11231#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11230#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11229#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11228#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11226#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11225#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11224#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11223#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11221#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11220#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11219#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11218#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11217#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11213#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11212#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11209#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11198#L562-3 [2024-11-09 15:25:54,692 INFO L747 eck$LassoCheckResult]: Loop: 11198#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11197#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 11198#L562-3 [2024-11-09 15:25:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1373220406, now seen corresponding path program 19 times [2024-11-09 15:25:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903795520] [2024-11-09 15:25:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:54,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 19 times [2024-11-09 15:25:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015233183] [2024-11-09 15:25:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1109848753, now seen corresponding path program 9 times [2024-11-09 15:25:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554474575] [2024-11-09 15:25:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:54,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:00,708 WARN L286 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 326 DAG size of output: 239 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:26:01,105 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:26:01,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:26:01,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:26:01,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:26:01,106 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:26:01,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:01,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:26:01,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:26:01,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration23_Lasso [2024-11-09 15:26:01,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:26:01,106 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:26:01,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:01,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:02,582 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:26:02,583 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:26:02,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,585 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-11-09 15:26:02,586 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-11-09 15:26:02,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-11-09 15:26:02,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,609 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-11-09 15:26:02,611 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-11-09 15:26:02,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:02,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:02,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2024-11-09 15:26:02,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,637 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-11-09 15:26:02,639 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-11-09 15:26:02,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2024-11-09 15:26:02,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,661 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-11-09 15:26:02,663 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-11-09 15:26:02,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2024-11-09 15:26:02,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,690 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-11-09 15:26:02,691 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-11-09 15:26:02,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-11-09 15:26:02,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,714 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-11-09 15:26:02,716 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-11-09 15:26:02,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:02,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:02,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-11-09 15:26:02,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,740 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-11-09 15:26:02,742 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-11-09 15:26:02,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-11-09 15:26:02,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,765 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-11-09 15:26:02,767 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-11-09 15:26:02,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-11-09 15:26:02,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,789 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-11-09 15:26:02,790 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-11-09 15:26:02,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-11-09 15:26:02,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,813 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-11-09 15:26:02,814 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-11-09 15:26:02,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:02,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:02,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-11-09 15:26:02,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,838 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-11-09 15:26:02,839 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-11-09 15:26:02,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2024-11-09 15:26:02,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,862 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-11-09 15:26:02,863 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-11-09 15:26:02,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-11-09 15:26:02,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,885 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-11-09 15:26:02,887 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-11-09 15:26:02,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2024-11-09 15:26:02,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,909 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-11-09 15:26:02,910 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-11-09 15:26:02,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:02,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:02,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:02,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:02,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,933 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-11-09 15:26:02,934 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-11-09 15:26:02,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:02,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:02,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-11-09 15:26:02,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,962 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-11-09 15:26:02,964 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-11-09 15:26:02,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:02,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:02,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:02,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:02,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:02,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:02,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:02,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-11-09 15:26:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:02,990 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:02,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-11-09 15:26:02,991 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-11-09 15:26:03,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:03,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2024-11-09 15:26:03,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,021 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-11-09 15:26:03,023 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-11-09 15:26:03,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:03,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2024-11-09 15:26:03,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,050 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-11-09 15:26:03,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-11-09 15:26:03,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:03,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:03,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,082 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-11-09 15:26:03,084 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-11-09 15:26:03,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:03,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-11-09 15:26:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,112 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-11-09 15:26:03,114 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-11-09 15:26:03,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:03,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:03,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,140 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-11-09 15:26:03,141 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-11-09 15:26:03,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:03,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-11-09 15:26:03,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,168 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-11-09 15:26:03,169 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-11-09 15:26:03,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:03,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-11-09 15:26:03,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,196 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-11-09 15:26:03,197 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-11-09 15:26:03,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:03,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:03,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:03,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:03,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:03,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:03,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:26:03,219 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:26:03,219 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:26:03,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:03,221 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:03,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-11-09 15:26:03,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:26:03,232 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:26:03,233 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:26:03,233 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1 Supporting invariants [] [2024-11-09 15:26:03,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2024-11-09 15:26:03,325 INFO L156 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed [2024-11-09 15:26:03,326 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:26:03,326 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:26:03,327 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:26:03,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:03,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:26:03,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:03,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-11-09 15:26:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:03,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:26:03,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:03,760 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-09 15:26:03,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:03,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-11-09 15:26:03,794 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-11-09 15:26:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:26:03,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-11-09 15:26:03,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:03,794 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:26:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:03,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:26:03,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:04,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:26:04,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:04,246 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-09 15:26:04,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:04,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-11-09 15:26:04,279 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-11-09 15:26:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:26:04,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-11-09 15:26:04,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:04,280 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:26:04,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:04,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:26:04,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:04,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:26:04,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:04,729 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-09 15:26:04,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:04,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 120 states and 154 transitions. Complement of second has 27 states. [2024-11-09 15:26:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:26:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2024-11-09 15:26:04,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 2 letters. [2024-11-09 15:26:04,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:04,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 86 letters. Loop has 2 letters. [2024-11-09 15:26:04,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:04,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 4 letters. [2024-11-09 15:26:04,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:04,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 154 transitions. [2024-11-09 15:26:04,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:04,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 115 states and 147 transitions. [2024-11-09 15:26:04,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:26:04,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:26:04,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2024-11-09 15:26:04,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:04,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 147 transitions. [2024-11-09 15:26:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2024-11-09 15:26:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2024-11-09 15:26:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 101 states have internal predecessors, (125), 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-11-09 15:26:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-11-09 15:26:04,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-11-09 15:26:04,975 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-11-09 15:26:04,975 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-09 15:26:04,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 125 transitions. [2024-11-09 15:26:04,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:04,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:04,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:04,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:04,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:04,976 INFO L745 eck$LassoCheckResult]: Stem: 12665#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12652#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 12653#L551 assume !(main_~length~0#1 < 1); 12662#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 12656#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 12657#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12666#L556 assume !(main_~val~0#1 < 0); 12703#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12663#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12664#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12647#L556 assume !(main_~val~0#1 < 0); 12648#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12649#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12702#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12701#L556 assume !(main_~val~0#1 < 0); 12700#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12699#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12698#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12697#L556 assume !(main_~val~0#1 < 0); 12696#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12695#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12694#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12693#L556 assume !(main_~val~0#1 < 0); 12692#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12691#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12690#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12689#L556 assume !(main_~val~0#1 < 0); 12688#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12687#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12686#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12685#L556 assume !(main_~val~0#1 < 0); 12684#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12683#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12682#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12681#L556 assume !(main_~val~0#1 < 0); 12680#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12679#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12678#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12677#L556 assume !(main_~val~0#1 < 0); 12676#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12675#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12674#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12671#L556 assume !(main_~val~0#1 < 0); 12673#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12672#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12670#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 12654#L554-4 main_~j~0#1 := 0; 12655#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12667#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12747#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12746#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12668#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12661#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12669#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12650#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12651#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12744#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12743#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12742#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12741#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12739#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12738#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12737#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12736#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12734#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12733#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12732#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12731#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12729#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12728#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12727#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12726#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12724#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12723#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12722#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12721#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12719#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12718#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12717#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12716#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12714#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12713#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12712#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12711#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12710#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12707#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12706#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12704#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12659#L562-3 [2024-11-09 15:26:04,977 INFO L747 eck$LassoCheckResult]: Loop: 12659#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12658#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 12659#L562-3 [2024-11-09 15:26:04,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1412762337, now seen corresponding path program 20 times [2024-11-09 15:26:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649851638] [2024-11-09 15:26:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 153 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649851638] [2024-11-09 15:26:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649851638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842469494] [2024-11-09 15:26:05,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:26:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:05,409 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:26:05,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2024-11-09 15:26:05,529 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:26:05,529 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:26:05,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:26:05,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:05,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842469494] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:06,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2024-11-09 15:26:06,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909855136] [2024-11-09 15:26:06,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:06,148 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:06,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 20 times [2024-11-09 15:26:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:06,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625684891] [2024-11-09 15:26:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:06,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 15:26:06,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 15:26:06,186 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. cyclomatic complexity: 36 Second operand has 38 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 38 states have internal predecessors, (140), 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-11-09 15:26:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:06,433 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2024-11-09 15:26:06,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 196 transitions. [2024-11-09 15:26:06,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:06,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 109 states and 134 transitions. [2024-11-09 15:26:06,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:26:06,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:26:06,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 134 transitions. [2024-11-09 15:26:06,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:06,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 134 transitions. [2024-11-09 15:26:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 134 transitions. [2024-11-09 15:26:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-11-09 15:26:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 105 states have internal predecessors, (130), 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-11-09 15:26:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2024-11-09 15:26:06,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-11-09 15:26:06,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 15:26:06,439 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-11-09 15:26:06,439 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-09 15:26:06,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 130 transitions. [2024-11-09 15:26:06,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:06,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:06,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:06,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:06,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:06,440 INFO L745 eck$LassoCheckResult]: Stem: 13490#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13478#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 13479#L551 assume !(main_~length~0#1 < 1); 13484#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 13482#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 13483#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13473#L556 assume !(main_~val~0#1 < 0); 13474#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13475#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13489#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13491#L556 assume !(main_~val~0#1 < 0); 13578#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13577#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13576#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13575#L556 assume !(main_~val~0#1 < 0); 13574#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13573#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13572#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13571#L556 assume !(main_~val~0#1 < 0); 13570#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13569#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13568#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13567#L556 assume !(main_~val~0#1 < 0); 13566#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13565#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13564#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13563#L556 assume !(main_~val~0#1 < 0); 13562#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13561#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13560#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13559#L556 assume !(main_~val~0#1 < 0); 13558#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13557#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13556#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13555#L556 assume !(main_~val~0#1 < 0); 13554#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13553#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13552#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13551#L556 assume !(main_~val~0#1 < 0); 13550#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13549#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13548#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13547#L556 assume !(main_~val~0#1 < 0); 13546#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13545#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13544#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13496#L556 assume !(main_~val~0#1 < 0); 13502#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13499#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13495#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 13480#L554-4 main_~j~0#1 := 0; 13481#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13492#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13493#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13476#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13477#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13488#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13543#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13542#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13541#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13539#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13538#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13537#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13536#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13534#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13533#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13532#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13531#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13529#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13528#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13527#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13526#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13524#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13523#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13522#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13521#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13519#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13518#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13517#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13516#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13514#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13513#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13512#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13511#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13509#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13508#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13507#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13506#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13505#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13501#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13500#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13497#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13486#L562-3 [2024-11-09 15:26:06,440 INFO L747 eck$LassoCheckResult]: Loop: 13486#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13485#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 13486#L562-3 [2024-11-09 15:26:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2010175208, now seen corresponding path program 21 times [2024-11-09 15:26:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953179324] [2024-11-09 15:26:06,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:06,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:06,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 21 times [2024-11-09 15:26:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:06,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635460986] [2024-11-09 15:26:06,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:06,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash 956909853, now seen corresponding path program 10 times [2024-11-09 15:26:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779128662] [2024-11-09 15:26:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:06,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:16,369 WARN L286 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 355 DAG size of output: 260 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:26:16,786 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:26:16,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:26:16,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:26:16,787 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:26:16,787 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:26:16,787 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:16,787 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:26:16,787 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:26:16,787 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration25_Lasso [2024-11-09 15:26:16,787 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:26:16,787 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:26:16,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:16,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:16,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:16,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:16,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:18,521 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:26:18,521 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:26:18,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,523 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-11-09 15:26:18,524 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-11-09 15:26:18,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-11-09 15:26:18,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,549 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-11-09 15:26:18,550 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-11-09 15:26:18,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:18,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:18,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:18,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-11-09 15:26:18,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,573 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-11-09 15:26:18,574 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-11-09 15:26:18,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2024-11-09 15:26:18,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,599 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-11-09 15:26:18,600 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-11-09 15:26:18,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:18,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:18,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:18,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2024-11-09 15:26:18,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,623 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-11-09 15:26:18,624 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-11-09 15:26:18,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-11-09 15:26:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,648 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-11-09 15:26:18,649 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-11-09 15:26:18,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2024-11-09 15:26:18,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,676 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-11-09 15:26:18,678 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-11-09 15:26:18,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-11-09 15:26:18,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,706 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-11-09 15:26:18,707 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-11-09 15:26:18,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-11-09 15:26:18,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,734 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-11-09 15:26:18,736 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-11-09 15:26:18,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:18,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,763 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-11-09 15:26:18,765 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-11-09 15:26:18,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,799 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-11-09 15:26:18,800 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-11-09 15:26:18,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2024-11-09 15:26:18,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,828 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-11-09 15:26:18,829 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-11-09 15:26:18,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2024-11-09 15:26:18,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,857 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-11-09 15:26:18,859 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-11-09 15:26:18,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2024-11-09 15:26:18,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,886 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-11-09 15:26:18,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:26:18,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:18,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:18,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,916 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-11-09 15:26:18,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-11-09 15:26:18,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:18,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:18,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:18,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:18,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:18,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:18,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:26:18,939 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:26:18,939 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:26:18,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:18,941 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:18,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-11-09 15:26:18,941 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:26:18,952 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:26:18,952 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:26:18,952 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1 Supporting invariants [] [2024-11-09 15:26:18,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:19,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2024-11-09 15:26:19,079 INFO L156 tatePredicateManager]: 44 out of 45 supporting invariants were superfluous and have been removed [2024-11-09 15:26:19,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:26:19,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:26:19,080 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-09 15:26:19,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:19,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:26:19,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:19,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:26:19,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:19,535 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-09 15:26:19,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) 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-11-09 15:26:19,572 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) 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) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-11-09 15:26:19,573 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-11-09 15:26:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) 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-11-09 15:26:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:26:19,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-11-09 15:26:19,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:19,573 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:26:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:19,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:26:19,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:20,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:26:20,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:20,085 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-09 15:26:20,085 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) 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-11-09 15:26:20,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) 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) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-11-09 15:26:20,135 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-11-09 15:26:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) 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-11-09 15:26:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:26:20,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-11-09 15:26:20,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:20,136 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:26:20,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:20,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:26:20,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:20,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:26:20,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:20,613 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-09 15:26:20,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) 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-11-09 15:26:20,939 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) 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) Result 130 states and 167 transitions. Complement of second has 29 states. [2024-11-09 15:26:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:26:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) 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-11-09 15:26:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 87 transitions. [2024-11-09 15:26:20,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 2 letters. [2024-11-09 15:26:20,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:20,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 94 letters. Loop has 2 letters. [2024-11-09 15:26:20,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:20,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 4 letters. [2024-11-09 15:26:20,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:20,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 167 transitions. [2024-11-09 15:26:20,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:20,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 160 transitions. [2024-11-09 15:26:20,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:26:20,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:26:20,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 160 transitions. [2024-11-09 15:26:20,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:20,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-11-09 15:26:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 160 transitions. [2024-11-09 15:26:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-11-09 15:26:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 110 states have internal predecessors, (136), 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-11-09 15:26:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2024-11-09 15:26:20,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-11-09 15:26:20,945 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-11-09 15:26:20,945 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-09 15:26:20,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 136 transitions. [2024-11-09 15:26:20,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:20,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:20,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:20,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:20,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:20,947 INFO L745 eck$LassoCheckResult]: Stem: 15083#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15071#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15072#L551 assume !(main_~length~0#1 < 1); 15077#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15075#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15076#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15066#L556 assume !(main_~val~0#1 < 0); 15067#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15068#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15082#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15084#L556 assume !(main_~val~0#1 < 0); 15126#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15125#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15124#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15123#L556 assume !(main_~val~0#1 < 0); 15122#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15121#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15120#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15119#L556 assume !(main_~val~0#1 < 0); 15118#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15117#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15116#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15115#L556 assume !(main_~val~0#1 < 0); 15114#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15113#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15112#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15111#L556 assume !(main_~val~0#1 < 0); 15110#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15109#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15108#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15107#L556 assume !(main_~val~0#1 < 0); 15106#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15105#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15104#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15103#L556 assume !(main_~val~0#1 < 0); 15102#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15101#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15100#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15099#L556 assume !(main_~val~0#1 < 0); 15098#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15097#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15096#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15095#L556 assume !(main_~val~0#1 < 0); 15094#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15093#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15092#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15089#L556 assume !(main_~val~0#1 < 0); 15091#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15090#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15088#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 15073#L554-4 main_~j~0#1 := 0; 15074#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15085#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15175#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15174#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15086#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15081#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15087#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15069#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15070#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15172#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15171#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15170#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15169#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15167#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15166#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15165#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15164#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15162#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15161#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15160#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15159#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15157#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15156#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15155#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15154#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15152#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15151#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15150#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15149#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15147#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15146#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15145#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15144#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15142#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15141#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15140#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15139#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15137#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15136#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15135#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15134#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15133#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15130#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15129#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15127#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15079#L562-3 [2024-11-09 15:26:20,947 INFO L747 eck$LassoCheckResult]: Loop: 15079#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15078#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15079#L562-3 [2024-11-09 15:26:20,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash 467367277, now seen corresponding path program 22 times [2024-11-09 15:26:20,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:20,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935797618] [2024-11-09 15:26:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 190 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935797618] [2024-11-09 15:26:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935797618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686854706] [2024-11-09 15:26:21,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:26:21,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:21,457 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:26:21,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2024-11-09 15:26:21,585 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:26:21,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:26:21,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:26:21,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:22,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686854706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:22,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2024-11-09 15:26:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297220074] [2024-11-09 15:26:22,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:22,286 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:22,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 22 times [2024-11-09 15:26:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:22,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182830843] [2024-11-09 15:26:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:22,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 15:26:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 15:26:22,330 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. cyclomatic complexity: 39 Second operand has 41 states, 40 states have (on average 3.8) internal successors, (152), 41 states have internal predecessors, (152), 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-11-09 15:26:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:22,578 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2024-11-09 15:26:22,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 213 transitions. [2024-11-09 15:26:22,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:22,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 118 states and 145 transitions. [2024-11-09 15:26:22,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:26:22,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:26:22,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 145 transitions. [2024-11-09 15:26:22,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:26:22,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-11-09 15:26:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 145 transitions. [2024-11-09 15:26:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-11-09 15:26:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 114 states have internal predecessors, (141), 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-11-09 15:26:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-11-09 15:26:22,582 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-11-09 15:26:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 15:26:22,582 INFO L425 stractBuchiCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-11-09 15:26:22,582 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-09 15:26:22,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 141 transitions. [2024-11-09 15:26:22,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:22,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:22,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:22,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:22,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:22,584 INFO L745 eck$LassoCheckResult]: Stem: 15983#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15971#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15972#L551 assume !(main_~length~0#1 < 1); 15981#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15975#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15976#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15966#L556 assume !(main_~val~0#1 < 0); 15967#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15968#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15982#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15984#L556 assume !(main_~val~0#1 < 0); 16080#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16079#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16078#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16077#L556 assume !(main_~val~0#1 < 0); 16076#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16075#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16074#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16073#L556 assume !(main_~val~0#1 < 0); 16072#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16071#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16070#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16069#L556 assume !(main_~val~0#1 < 0); 16068#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16067#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16066#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16065#L556 assume !(main_~val~0#1 < 0); 16064#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16063#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16062#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16061#L556 assume !(main_~val~0#1 < 0); 16060#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16059#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16058#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16057#L556 assume !(main_~val~0#1 < 0); 16056#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16055#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16054#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16053#L556 assume !(main_~val~0#1 < 0); 16052#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16051#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16050#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16049#L556 assume !(main_~val~0#1 < 0); 16048#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16047#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16046#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16045#L556 assume !(main_~val~0#1 < 0); 16044#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16043#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16042#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15989#L556 assume !(main_~val~0#1 < 0); 15995#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15992#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15988#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 15973#L554-4 main_~j~0#1 := 0; 15974#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15985#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15986#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15969#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15970#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15980#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16041#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16040#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16039#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16037#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16036#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16035#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16034#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16032#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16031#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16030#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16029#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16027#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16026#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16025#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16024#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16022#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16021#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16020#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16019#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16017#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16016#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16015#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16014#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16012#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16011#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16010#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16009#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16007#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16006#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16005#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16004#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16002#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16001#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16000#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15999#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15998#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15994#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15993#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15990#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15978#L562-3 [2024-11-09 15:26:22,585 INFO L747 eck$LassoCheckResult]: Loop: 15978#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15977#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15978#L562-3 [2024-11-09 15:26:22,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:22,585 INFO L85 PathProgramCache]: Analyzing trace with hash 753705062, now seen corresponding path program 23 times [2024-11-09 15:26:22,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:22,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059791623] [2024-11-09 15:26:22,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:22,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 23 times [2024-11-09 15:26:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:22,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143728946] [2024-11-09 15:26:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:22,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:22,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1538906901, now seen corresponding path program 11 times [2024-11-09 15:26:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056062427] [2024-11-09 15:26:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:22,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace