./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/b.13-alloca.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 e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:10:40,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:10:41,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-23 02:10:41,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:10:41,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:10:41,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:10:41,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:10:41,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:10:41,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:10:41,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:10:41,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:10:41,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:10:41,059 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:10:41,059 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:10:41,061 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:10:41,061 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:10:41,062 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:10:41,062 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:10:41,062 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:10:41,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:10:41,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:10:41,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:10:41,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:10:41,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:10:41,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:10:41,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:10:41,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:10:41,065 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:10:41,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:10:41,065 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:10:41,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:10:41,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:10:41,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:10:41,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:10:41,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:10:41,067 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:10:41,068 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 -> e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 [2024-11-23 02:10:41,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:10:41,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:10:41,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:10:41,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:10:41,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:10:41,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2024-11-23 02:10:42,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:10:43,143 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:10:43,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2024-11-23 02:10:43,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85284414e/b27c0c62da3f41238dae509073caca25/FLAG56bb57f75 [2024-11-23 02:10:43,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85284414e/b27c0c62da3f41238dae509073caca25 [2024-11-23 02:10:43,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:10:43,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:10:43,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:10:43,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:10:43,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:10:43,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52902a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43, skipping insertion in model container [2024-11-23 02:10:43,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:10:43,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:10:43,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:10:43,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:10:43,628 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:10:43,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43 WrapperNode [2024-11-23 02:10:43,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:10:43,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:10:43,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:10:43,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:10:43,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,677 INFO L138 Inliner]: procedures = 111, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2024-11-23 02:10:43,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:10:43,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:10:43,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:10:43,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:10:43,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,714 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [5, 5, 2, 5]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [2, 1, 1, 2]. [2024-11-23 02:10:43,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:10:43,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:10:43,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:10:43,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:10:43,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (1/1) ... [2024-11-23 02:10:43,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:43,773 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-23 02:10:43,775 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-23 02:10:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:10:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:10:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 02:10:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-23 02:10:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:10:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:10:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 02:10:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-23 02:10:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:10:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:10:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:10:43,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:10:43,916 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:10:43,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:10:44,112 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-23 02:10:44,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:10:44,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:10:44,129 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-23 02:10:44,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:44 BoogieIcfgContainer [2024-11-23 02:10:44,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:10:44,132 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:10:44,132 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:10:44,137 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:10:44,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:10:44,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:10:43" (1/3) ... [2024-11-23 02:10:44,139 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3da9f716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:10:44, skipping insertion in model container [2024-11-23 02:10:44,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:10:44,140 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:43" (2/3) ... [2024-11-23 02:10:44,140 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3da9f716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:10:44, skipping insertion in model container [2024-11-23 02:10:44,140 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:10:44,140 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:44" (3/3) ... [2024-11-23 02:10:44,142 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.13-alloca.i [2024-11-23 02:10:44,189 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:10:44,189 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:10:44,189 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:10:44,190 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:10:44,190 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:10:44,190 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:10:44,190 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:10:44,190 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:10:44,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:44,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:10:44,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:44,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:44,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:10:44,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:10:44,219 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:10:44,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:44,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:10:44,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:44,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:44,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:10:44,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:10:44,229 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 8#L561-2true [2024-11-23 02:10:44,230 INFO L747 eck$LassoCheckResult]: Loop: 8#L561-2true call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 12#L557-1true assume test_fun_#t~short10#1; 10#L557-3true assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 6#L558true assume test_fun_#t~mem11#1 > test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1; 8#L561-2true [2024-11-23 02:10:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:10:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147783872] [2024-11-23 02:10:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:44,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:44,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2024-11-23 02:10:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462158362] [2024-11-23 02:10:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:44,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:44,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:44,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2024-11-23 02:10:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:44,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432255902] [2024-11-23 02:10:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:44,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:44,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:45,882 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:10:45,883 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:10:45,883 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:10:45,883 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:10:45,883 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:10:45,884 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:45,884 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:10:45,884 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:10:45,884 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration1_Lasso [2024-11-23 02:10:45,884 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:10:45,884 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:10:45,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:45,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:45,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:45,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:45,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:45,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:46,866 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:10:46,871 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:10:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:46,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:46,875 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-23 02:10:46,876 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-23 02:10:46,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-23 02:10:46,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:46,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:46,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:46,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:46,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:46,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:46,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:46,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:46,906 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-23 02:10:46,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:46,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:46,910 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-23 02:10:46,911 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-23 02:10:46,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:46,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:46,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:46,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:46,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:46,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:46,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:46,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:46,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:46,938 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-23 02:10:46,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:46,941 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-23 02:10:46,943 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-23 02:10:46,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:46,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:46,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:46,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:46,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:46,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:46,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:46,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:46,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-23 02:10:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:46,983 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-23 02:10:46,984 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-23 02:10:46,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:46,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:46,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:46,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:46,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:46,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:46,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:47,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:47,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,009 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-23 02:10:47,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,011 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-23 02:10:47,012 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-23 02:10:47,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:47,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:47,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:47,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:47,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,033 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-23 02:10:47,034 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-23 02:10:47,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,088 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-23 02:10:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,091 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-23 02:10:47,093 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-23 02:10:47,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,123 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-23 02:10:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,126 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-23 02:10:47,126 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-23 02:10:47,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,150 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-23 02:10:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,152 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-23 02:10:47,153 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-23 02:10:47,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,181 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-23 02:10:47,184 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-23 02:10:47,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,209 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-23 02:10:47,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,212 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-23 02:10:47,213 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-23 02:10:47,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-23 02:10:47,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-23 02:10:47,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,240 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-23 02:10:47,241 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-23 02:10:47,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-23 02:10:47,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,274 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-23 02:10:47,275 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-23 02:10:47,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:47,307 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-23 02:10:47,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,312 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-23 02:10:47,316 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-23 02:10:47,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:47,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:47,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:47,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:47,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:47,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:47,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:47,342 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:10:47,376 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-23 02:10:47,377 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-23 02:10:47,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:47,386 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-23 02:10:47,388 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-23 02:10:47,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:10:47,404 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:10:47,404 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:10:47,405 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int#3 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1 Supporting invariants [] [2024-11-23 02:10:47,412 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-23 02:10:47,476 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-23 02:10:47,540 INFO L156 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2024-11-23 02:10:47,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-23 02:10:47,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-23 02:10:47,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-23 02:10:47,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-23 02:10:47,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-23 02:10:47,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-23 02:10:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:47,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 02:10:47,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:47,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:10:47,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:47,770 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-23 02:10:47,804 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-23 02:10:47,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:47,924 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 59 transitions. Complement of second has 10 states. [2024-11-23 02:10:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-23 02:10:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2024-11-23 02:10:47,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-23 02:10:47,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:47,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-23 02:10:47,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:47,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-23 02:10:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:47,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2024-11-23 02:10:47,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:10:47,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 25 states and 39 transitions. [2024-11-23 02:10:47,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-23 02:10:47,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-23 02:10:47,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 39 transitions. [2024-11-23 02:10:47,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:47,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 39 transitions. [2024-11-23 02:10:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 39 transitions. [2024-11-23 02:10:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-23 02:10:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 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-23 02:10:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2024-11-23 02:10:47,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 37 transitions. [2024-11-23 02:10:47,978 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2024-11-23 02:10:47,978 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:10:47,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2024-11-23 02:10:47,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:10:47,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:47,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:47,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:10:47,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:10:47,980 INFO L745 eck$LassoCheckResult]: Stem: 227#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 228#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 232#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 230#L557-1 [2024-11-23 02:10:47,980 INFO L747 eck$LassoCheckResult]: Loop: 230#L557-1 assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 233#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 234#L558 assume test_fun_#t~mem11#1 > test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1; 229#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 230#L557-1 [2024-11-23 02:10:47,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-23 02:10:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113603624] [2024-11-23 02:10:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:48,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:48,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:48,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2024-11-23 02:10:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651887274] [2024-11-23 02:10:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:48,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:48,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:48,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2024-11-23 02:10:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:48,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726145328] [2024-11-23 02:10:48,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:48,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:10:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726145328] [2024-11-23 02:10:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726145328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:10:48,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:10:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:10:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291536727] [2024-11-23 02:10:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:10:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:48,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:10:48,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:10:48,625 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-23 02:10:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:48,680 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2024-11-23 02:10:48,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 53 transitions. [2024-11-23 02:10:48,682 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:10:48,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 37 transitions. [2024-11-23 02:10:48,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-23 02:10:48,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-23 02:10:48,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2024-11-23 02:10:48,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:48,684 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 37 transitions. [2024-11-23 02:10:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2024-11-23 02:10:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2024-11-23 02:10:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-23 02:10:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2024-11-23 02:10:48,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-11-23 02:10:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:10:48,687 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-11-23 02:10:48,689 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:10:48,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2024-11-23 02:10:48,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:10:48,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:48,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:48,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:10:48,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:10:48,690 INFO L745 eck$LassoCheckResult]: Stem: 298#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 304#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 300#L557-1 [2024-11-23 02:10:48,690 INFO L747 eck$LassoCheckResult]: Loop: 300#L557-1 assume test_fun_#t~short10#1; 302#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 295#L558 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 291#L561 assume test_fun_#t~mem14#1 > test_fun_#t~mem15#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;call test_fun_#t~mem16#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem16#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem16#1; 292#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 300#L557-1 [2024-11-23 02:10:48,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2024-11-23 02:10:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228398855] [2024-11-23 02:10:48,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:48,716 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:10:48,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:48,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:48,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:48,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 38423515, now seen corresponding path program 1 times [2024-11-23 02:10:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:48,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118681377] [2024-11-23 02:10:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:48,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:48,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:48,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash 177751320, now seen corresponding path program 1 times [2024-11-23 02:10:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:48,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252953295] [2024-11-23 02:10:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:10:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:48,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252953295] [2024-11-23 02:10:48,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252953295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:10:48,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:10:48,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:10:48,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928979347] [2024-11-23 02:10:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:10:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:10:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:10:49,101 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:49,122 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2024-11-23 02:10:49,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2024-11-23 02:10:49,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:10:49,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 15 transitions. [2024-11-23 02:10:49,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-23 02:10:49,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-23 02:10:49,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-11-23 02:10:49,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:49,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-23 02:10:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-11-23 02:10:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-23 02:10:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-23 02:10:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-11-23 02:10:49,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-23 02:10:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:10:49,126 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-23 02:10:49,126 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:10:49,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-11-23 02:10:49,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:10:49,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:49,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:49,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:10:49,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:10:49,127 INFO L745 eck$LassoCheckResult]: Stem: 336#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 342#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 338#L557-1 [2024-11-23 02:10:49,127 INFO L747 eck$LassoCheckResult]: Loop: 338#L557-1 assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 340#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 333#L558 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 331#L561 assume test_fun_#t~mem14#1 > test_fun_#t~mem15#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;call test_fun_#t~mem16#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem16#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem16#1; 332#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 338#L557-1 [2024-11-23 02:10:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2024-11-23 02:10:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:49,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214110611] [2024-11-23 02:10:49,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:10:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:49,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:10:49,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:49,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:49,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:49,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash 40270557, now seen corresponding path program 1 times [2024-11-23 02:10:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426541590] [2024-11-23 02:10:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:49,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:49,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:49,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash 179598362, now seen corresponding path program 1 times [2024-11-23 02:10:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004435198] [2024-11-23 02:10:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:49,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:49,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:50,233 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:10:50,234 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:10:50,234 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:10:50,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:10:50,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:10:50,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:50,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:10:50,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:10:50,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration4_Lasso [2024-11-23 02:10:50,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:10:50,234 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:10:50,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:50,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:51,290 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:10:51,293 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:10:51,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:51,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:51,296 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-23 02:10:51,297 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-23 02:10:51,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:51,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:51,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:51,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:51,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:51,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:51,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:51,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:51,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:51,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:51,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:51,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:51,320 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-23 02:10:51,321 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-23 02:10:51,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:51,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:51,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:51,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:51,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:51,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:51,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:51,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:51,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:51,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:51,340 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:51,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 02:10:51,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:51,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:51,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:51,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:51,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:51,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:51,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:51,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:51,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:51,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-23 02:10:51,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:51,364 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-23 02:10:51,365 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-23 02:10:51,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:51,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:51,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:51,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:51,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:51,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:51,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:51,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:51,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:51,383 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-23 02:10:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:51,384 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-23 02:10:51,385 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-23 02:10:51,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-23 02:10:51,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:51,397 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-23 02:10:51,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:51,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:51,404 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-23 02:10:51,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:51,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:10:51,433 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-23 02:10:51,433 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-23 02:10:51,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:51,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:51,435 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-23 02:10:51,436 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-23 02:10:51,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:10:51,447 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:10:51,447 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:10:51,447 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2, v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 Supporting invariants [] [2024-11-23 02:10:51,455 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-23 02:10:51,540 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2024-11-23 02:10:51,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-23 02:10:51,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-23 02:10:51,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-23 02:10:51,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-23 02:10:51,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-23 02:10:51,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-23 02:10:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:51,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:10:51,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:51,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:10:51,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:51,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-23 02:10:51,704 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-23 02:10:51,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-23 02:10:51,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:51,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 38 transitions. Complement of second has 8 states. [2024-11-23 02:10:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-23 02:10:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-11-23 02:10:51,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 5 letters. [2024-11-23 02:10:51,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:51,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-23 02:10:51,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:51,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 10 letters. [2024-11-23 02:10:51,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:51,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2024-11-23 02:10:51,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:10:51,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2024-11-23 02:10:51,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-23 02:10:51,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-23 02:10:51,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2024-11-23 02:10:51,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:51,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-23 02:10:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2024-11-23 02:10:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-11-23 02:10:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-23 02:10:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-11-23 02:10:51,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-23 02:10:51,768 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-23 02:10:51,768 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:10:51,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2024-11-23 02:10:51,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:10:51,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:51,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:51,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:10:51,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:10:51,770 INFO L745 eck$LassoCheckResult]: Stem: 585#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 586#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 592#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 599#L557-1 assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 589#L557-3 [2024-11-23 02:10:51,770 INFO L747 eck$LassoCheckResult]: Loop: 589#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 582#L558 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 577#L561 assume !(test_fun_#t~mem14#1 > test_fun_#t~mem15#1);havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1; 578#L561-2 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 587#L557-1 assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 589#L557-3 [2024-11-23 02:10:51,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-11-23 02:10:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834608340] [2024-11-23 02:10:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:51,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:51,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:51,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 45964859, now seen corresponding path program 1 times [2024-11-23 02:10:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630535088] [2024-11-23 02:10:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:51,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:51,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1272583860, now seen corresponding path program 1 times [2024-11-23 02:10:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:51,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939080925] [2024-11-23 02:10:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:51,971 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-23 02:10:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:10:51,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:51,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939080925] [2024-11-23 02:10:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939080925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:10:51,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:10:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:10:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236340467] [2024-11-23 02:10:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:10:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:10:52,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:10:52,146 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 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-23 02:10:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:52,179 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-23 02:10:52,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-11-23 02:10:52,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:10:52,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2024-11-23 02:10:52,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:10:52,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:10:52,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:10:52,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:10:52,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:10:52,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:10:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:10:52,181 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:10:52,181 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:10:52,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:10:52,182 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:10:52,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:10:52,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:10:52 BoogieIcfgContainer [2024-11-23 02:10:52,192 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:10:52,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:10:52,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:10:52,193 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:10:52,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:44" (3/4) ... [2024-11-23 02:10:52,195 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:10:52,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:10:52,196 INFO L158 Benchmark]: Toolchain (without parser) took 9023.82ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 100.8MB in the beginning and 186.0MB in the end (delta: -85.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-23 02:10:52,196 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:10:52,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.61ms. Allocated memory is still 157.3MB. Free memory was 100.5MB in the beginning and 81.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-23 02:10:52,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.72ms. Allocated memory is still 157.3MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:10:52,197 INFO L158 Benchmark]: Boogie Preprocessor took 58.52ms. Allocated memory is still 157.3MB. Free memory was 79.6MB in the beginning and 77.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:10:52,197 INFO L158 Benchmark]: RCFGBuilder took 393.17ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 77.5MB in the beginning and 175.1MB in the end (delta: -97.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-23 02:10:52,198 INFO L158 Benchmark]: BuchiAutomizer took 8059.61ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 175.1MB in the beginning and 187.1MB in the end (delta: -12.0MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-23 02:10:52,198 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 251.7MB. Free memory was 187.1MB in the beginning and 186.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:10:52,199 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.61ms. Allocated memory is still 157.3MB. Free memory was 100.5MB in the beginning and 81.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.72ms. Allocated memory is still 157.3MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.52ms. Allocated memory is still 157.3MB. Free memory was 79.6MB in the beginning and 77.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.17ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 77.5MB in the beginning and 175.1MB in the end (delta: -97.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 8059.61ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 175.1MB in the beginning and 187.1MB in the end (delta: -12.0MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 251.7MB. Free memory was 187.1MB in the beginning and 186.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 7.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 36 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital278 mio100 ax106 hnf100 lsp97 ukn65 mio100 lsp26 div100 bol104 ite100 ukn100 eq159 hnf90 smp100 dnf141 smp83 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 64ms VariablesStem: 7 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-23 02:10:52,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE