./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.15-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 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:19:27,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:19:27,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:19:27,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:19:27,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:19:27,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:19:27,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:19:27,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:19:27,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:19:27,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:19:27,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:19:27,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:19:27,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:19:27,979 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:19:27,979 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:19:27,980 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:19:27,980 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:19:27,980 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:19:27,980 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:19:27,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:19:27,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:19:27,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:19:27,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:19:27,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:19:27,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:19:27,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:19:27,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:19:27,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:19:27,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:19:27,986 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:19:27,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:19:27,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:19:27,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:19:27,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:19:27,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:19:27,989 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:19:27,989 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 -> 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 [2024-11-19 14:19:28,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:19:28,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:19:28,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:19:28,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:19:28,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:19:28,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2024-11-19 14:19:29,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:19:30,073 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:19:30,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2024-11-19 14:19:30,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c931eba8e/6deb33e8f3594b59a8987d6baf2ef4e7/FLAG70eb0be3f [2024-11-19 14:19:30,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c931eba8e/6deb33e8f3594b59a8987d6baf2ef4e7 [2024-11-19 14:19:30,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:19:30,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:19:30,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:19:30,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:19:30,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:19:30,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c02bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30, skipping insertion in model container [2024-11-19 14:19:30,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:19:30,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:19:30,719 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:19:30,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:19:30,785 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:19:30,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30 WrapperNode [2024-11-19 14:19:30,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:19:30,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:19:30,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:19:30,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:19:30,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,829 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2024-11-19 14:19:30,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:19:30,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:19:30,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:19:30,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:19:30,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,858 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [3, 5, 5, 2]. 33 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 [1, 2, 2, 1]. [2024-11-19 14:19:30,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:19:30,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:19:30,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:19:30,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:19:30,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (1/1) ... [2024-11-19 14:19:30,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:30,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:30,911 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-19 14:19:30,913 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-19 14:19:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:19:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:19:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:19:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 14:19:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:19:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:19:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:19:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 14:19:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:19:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:19:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:19:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:19:31,057 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:19:31,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:19:31,188 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-19 14:19:31,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:19:31,207 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:19:31,207 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:19:31,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:31 BoogieIcfgContainer [2024-11-19 14:19:31,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:19:31,210 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:19:31,210 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:19:31,214 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:19:31,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:31,215 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:19:30" (1/3) ... [2024-11-19 14:19:31,215 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2993a36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:19:31, skipping insertion in model container [2024-11-19 14:19:31,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:31,216 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:30" (2/3) ... [2024-11-19 14:19:31,216 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2993a36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:19:31, skipping insertion in model container [2024-11-19 14:19:31,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:31,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:31" (3/3) ... [2024-11-19 14:19:31,218 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.15-alloca.i [2024-11-19 14:19:31,271 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:19:31,271 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:19:31,272 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:19:31,272 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:19:31,272 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:19:31,272 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:19:31,272 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:19:31,272 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:19:31,276 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-19 14:19:31,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:19:31,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:31,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:31,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:19:31,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:19:31,294 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:19:31,294 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-19 14:19:31,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:19:31,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:31,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:31,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:19:31,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:19:31,301 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~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#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#3(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 12#L558-4true [2024-11-19 14:19:31,301 INFO L747 eck$LassoCheckResult]: Loop: 12#L558-4true call test_fun_#t~mem6#1 := read~int#2(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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 11#L557-1true assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#0(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; 9#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; 5#L558-3true assume !true; 12#L558-4true [2024-11-19 14:19:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:19:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392634585] [2024-11-19 14:19:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:31,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:31,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2024-11-19 14:19:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617009629] [2024-11-19 14:19:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:31,624 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-19 14:19:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617009629] [2024-11-19 14:19:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617009629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:31,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:31,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 14:19:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872341980] [2024-11-19 14:19:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:31,651 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:19:31,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:31,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:19:31,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:19:31,699 INFO L87 Difference]: Start difference. 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:31,705 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2024-11-19 14:19:31,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2024-11-19 14:19:31,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:19:31,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2024-11-19 14:19:31,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:19:31,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:19:31,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2024-11-19 14:19:31,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:31,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2024-11-19 14:19:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2024-11-19 14:19:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-19 14:19:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-19 14:19:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2024-11-19 14:19:31,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2024-11-19 14:19:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:19:31,746 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2024-11-19 14:19:31,746 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:19:31,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2024-11-19 14:19:31,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:19:31,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:31,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:31,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:19:31,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:31,748 INFO L745 eck$LassoCheckResult]: Stem: 34#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~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#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#3(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 36#L558-4 [2024-11-19 14:19:31,748 INFO L747 eck$LassoCheckResult]: Loop: 36#L558-4 call test_fun_#t~mem6#1 := read~int#2(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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 38#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#0(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; 37#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; 32#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 33#L558-1 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 36#L558-4 [2024-11-19 14:19:31,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:19:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380433785] [2024-11-19 14:19:31,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:31,802 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:31,802 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:31,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:31,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:31,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2024-11-19 14:19:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615153038] [2024-11-19 14:19:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:32,103 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-19 14:19:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:32,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615153038] [2024-11-19 14:19:32,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615153038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:32,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:19:32,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412661148] [2024-11-19 14:19:32,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:32,105 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:19:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:32,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:19:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:19:32,107 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 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-19 14:19:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:32,221 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2024-11-19 14:19:32,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2024-11-19 14:19:32,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:19:32,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2024-11-19 14:19:32,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:19:32,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:19:32,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-11-19 14:19:32,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:32,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-19 14:19:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-11-19 14:19:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-19 14:19:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-19 14:19:32,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-19 14:19:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:19:32,230 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-19 14:19:32,230 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:19:32,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-19 14:19:32,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:19:32,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:32,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:32,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:19:32,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2024-11-19 14:19:32,231 INFO L745 eck$LassoCheckResult]: Stem: 66#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 67#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~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#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#3(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 69#L558-4 [2024-11-19 14:19:32,231 INFO L747 eck$LassoCheckResult]: Loop: 69#L558-4 call test_fun_#t~mem6#1 := read~int#2(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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 72#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#0(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; 70#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; 71#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 68#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 64#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 65#L558-1 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 69#L558-4 [2024-11-19 14:19:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:19:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314082678] [2024-11-19 14:19:32,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:32,268 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:19:32,268 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:32,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:32,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:32,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2024-11-19 14:19:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:32,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446605677] [2024-11-19 14:19:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:32,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:32,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:32,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:32,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2024-11-19 14:19:32,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:32,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817631633] [2024-11-19 14:19:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:32,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:32,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:33,538 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:33,539 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:33,539 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:33,539 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:33,539 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:33,539 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:33,539 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:33,539 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:33,539 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration3_Lasso [2024-11-19 14:19:33,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:33,540 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:33,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:33,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:34,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:34,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:34,820 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:34,824 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:34,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:34,829 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-19 14:19:34,830 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-19 14:19:34,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:34,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:34,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:34,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:34,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:34,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:34,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:34,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:34,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:34,864 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-19 14:19:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:34,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:34,865 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-19 14:19:34,866 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-19 14:19:34,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:34,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:34,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:34,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:34,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:34,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:34,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:34,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:34,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:34,890 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-19 14:19:34,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:34,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:34,892 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-19 14:19:34,893 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-19 14:19:34,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:34,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:34,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:34,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:34,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:34,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:34,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:34,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:34,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:34,921 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-19 14:19:34,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:34,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:34,924 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-19 14:19:34,926 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-19 14:19:34,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:34,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:34,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:34,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:34,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:34,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:34,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:34,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:34,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:34,956 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-19 14:19:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:34,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:34,958 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-19 14:19:34,958 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-19 14:19:34,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:34,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:34,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:34,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:34,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:34,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:34,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:34,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:34,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:19:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:34,989 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-19 14:19:34,991 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-19 14:19:34,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:35,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:35,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,015 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-19 14:19:35,016 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-19 14:19:35,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:35,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,046 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-19 14:19:35,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,048 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-19 14:19:35,049 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-19 14:19:35,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,080 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-19 14:19:35,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,082 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-19 14:19:35,083 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-19 14:19:35,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:35,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:19:35,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,118 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-19 14:19:35,120 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-19 14:19:35,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,151 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-19 14:19:35,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,152 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-19 14:19:35,153 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-19 14:19:35,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:35,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:35,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:35,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,183 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-19 14:19:35,184 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-19 14:19:35,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-19 14:19:35,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,208 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-19 14:19:35,209 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-19 14:19:35,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:35,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,237 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-19 14:19:35,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,239 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-19 14:19:35,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,245 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-19 14:19:35,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:35,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:35,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:35,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,270 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-19 14:19:35,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,273 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-19 14:19:35,274 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-19 14:19:35,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:35,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:35,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:35,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,300 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-19 14:19:35,301 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-19 14:19:35,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:35,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:35,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,330 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-19 14:19:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,333 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-19 14:19:35,334 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-19 14:19:35,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:35,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:35,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:35,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:19:35,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,371 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-19 14:19:35,373 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-19 14:19:35,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:35,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:35,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:35,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:35,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:35,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:35,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:35,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:35,479 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-19 14:19:35,479 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-19 14:19:35,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:35,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:35,484 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-19 14:19:35,486 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-19 14:19:35,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:35,500 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:35,500 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:35,501 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1, v_rep(select (select #memory_int#0 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#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1 Supporting invariants [] [2024-11-19 14:19:35,517 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-19 14:19:35,654 INFO L156 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2024-11-19 14:19:35,662 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:35,663 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:35,664 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-19 14:19:35,664 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:19:35,664 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:19:35,664 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-19 14:19:35,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:35,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:19:35,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:35,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:19:35,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:35,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 14:19:35,958 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-19 14:19:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:35,998 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-19 14:19:35,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-19 14:19:36,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 27 transitions. Complement of second has 10 states. [2024-11-19 14:19:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-19 14:19:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-19 14:19:36,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2024-11-19 14:19:36,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:36,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2024-11-19 14:19:36,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:36,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2024-11-19 14:19:36,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:36,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2024-11-19 14:19:36,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:36,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2024-11-19 14:19:36,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:19:36,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:19:36,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2024-11-19 14:19:36,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:36,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-11-19 14:19:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2024-11-19 14:19:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-19 14:19:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-19 14:19:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-19 14:19:36,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:19:36,181 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:19:36,181 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:19:36,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-19 14:19:36,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:36,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:36,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:36,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:36,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:36,183 INFO L745 eck$LassoCheckResult]: Stem: 314#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~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#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#3(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 317#L558-4 call test_fun_#t~mem6#1 := read~int#2(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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 319#L557-1 assume !test_fun_#t~short10#1; 318#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; 312#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 313#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 316#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 311#L558-1 [2024-11-19 14:19:36,183 INFO L747 eck$LassoCheckResult]: Loop: 311#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 310#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 311#L558-1 [2024-11-19 14:19:36,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2024-11-19 14:19:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719314316] [2024-11-19 14:19:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:19:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719314316] [2024-11-19 14:19:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719314316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:36,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:36,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:19:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348651779] [2024-11-19 14:19:36,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:36,251 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:36,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2024-11-19 14:19:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:36,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182487785] [2024-11-19 14:19:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:36,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:36,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:36,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:36,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:36,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:19:36,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:19:36,386 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-19 14:19:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:36,394 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-11-19 14:19:36,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-11-19 14:19:36,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:36,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2024-11-19 14:19:36,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:19:36,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:19:36,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2024-11-19 14:19:36,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:36,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-19 14:19:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2024-11-19 14:19:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-19 14:19:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-19 14:19:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-19 14:19:36,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-19 14:19:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:19:36,399 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-19 14:19:36,399 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:19:36,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2024-11-19 14:19:36,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:36,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:36,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:36,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:36,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:36,401 INFO L745 eck$LassoCheckResult]: Stem: 347#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~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#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#3(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 350#L558-4 call test_fun_#t~mem6#1 := read~int#2(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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 353#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#0(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; 351#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; 352#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 355#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 354#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 344#L558-1 [2024-11-19 14:19:36,401 INFO L747 eck$LassoCheckResult]: Loop: 344#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 343#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 344#L558-1 [2024-11-19 14:19:36,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2024-11-19 14:19:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:36,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123660612] [2024-11-19 14:19:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:36,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:36,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:36,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2024-11-19 14:19:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943357668] [2024-11-19 14:19:36,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:36,448 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:36,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:36,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:36,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2024-11-19 14:19:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:36,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860393410] [2024-11-19 14:19:36,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:36,508 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-19 14:19:36,520 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:36,520 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:36,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:36,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:38,035 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:38,035 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:38,035 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:38,035 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:38,035 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:38,035 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:38,035 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:38,035 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:38,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration5_Lasso [2024-11-19 14:19:38,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:38,036 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:38,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:38,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:39,087 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:39,088 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:39,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,090 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-19 14:19:39,092 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-19 14:19:39,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:39,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:39,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:39,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,115 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-19 14:19:39,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,117 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-19 14:19:39,118 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-19 14:19:39,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:39,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:39,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:39,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,140 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-19 14:19:39,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,141 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:19:39,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-19 14:19:39,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,182 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:19:39,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-19 14:19:39,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,214 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:19:39,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:39,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,247 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:19:39,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:39,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,283 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:19:39,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 14:19:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,311 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:19:39,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:39,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:39,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,354 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:19:39,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:39,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,389 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:19:39,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:39,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,418 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:19:39,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 14:19:39,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,449 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:19:39,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:19:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,480 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:19:39,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:39,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-19 14:19:39,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,508 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:19:39,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:19:39,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:39,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:39,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:39,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:39,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:39,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:39,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:39,560 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-11-19 14:19:39,560 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-19 14:19:39,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:39,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:39,562 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:39,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:19:39,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:39,573 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-19 14:19:39,574 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:39,574 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem12#1, ULTIMATE.start_test_fun_#t~mem11#1) = -1*ULTIMATE.start_test_fun_#t~mem12#1 + 1*ULTIMATE.start_test_fun_#t~mem11#1 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem12#1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 + 1*ULTIMATE.start_test_fun_#t~mem11#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2 >= 0] [2024-11-19 14:19:39,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:39,696 INFO L156 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2024-11-19 14:19:39,698 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem12 [2024-11-19 14:19:39,698 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem11 [2024-11-19 14:19:39,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:39,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:19:39,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:39,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:39,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:39,785 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 31 treesize of output 19 [2024-11-19 14:19:39,803 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-19 14:19:39,804 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:19:39,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:39,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 31 transitions. Complement of second has 5 states. [2024-11-19 14:19:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-19 14:19:39,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-19 14:19:39,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:39,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:19:39,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:39,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-19 14:19:39,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:39,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2024-11-19 14:19:39,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:39,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2024-11-19 14:19:39,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:19:39,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:19:39,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2024-11-19 14:19:39,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:39,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-19 14:19:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2024-11-19 14:19:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-11-19 14:19:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-19 14:19:39,836 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-19 14:19:39,836 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-19 14:19:39,836 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:19:39,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2024-11-19 14:19:39,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:39,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:39,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:39,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2024-11-19 14:19:39,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:39,837 INFO L745 eck$LassoCheckResult]: Stem: 593#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 594#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#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_~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#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#3(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 598#L558-4 call test_fun_#t~mem6#1 := read~int#2(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_~y_ref~0#1.base, test_fun_~y_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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#0(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; 596#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; 597#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 595#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 591#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 592#L558-1 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 600#L558-4 call test_fun_#t~mem6#1 := read~int#2(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_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 601#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#0(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; 605#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; 604#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 603#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 602#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 590#L558-1 [2024-11-19 14:19:39,838 INFO L747 eck$LassoCheckResult]: Loop: 590#L558-1 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#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(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;call test_fun_#t~mem14#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 589#L558-3 call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 590#L558-1 [2024-11-19 14:19:39,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2024-11-19 14:19:39,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:39,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813233463] [2024-11-19 14:19:39,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:39,868 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:39,869 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:19:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813233463] [2024-11-19 14:19:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813233463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 14:19:40,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954716000] [2024-11-19 14:19:40,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:40,085 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:40,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2024-11-19 14:19:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107923624] [2024-11-19 14:19:40,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:40,092 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:19:40,093 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:40,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:40,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:40,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:19:40,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:19:40,208 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:40,243 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-19 14:19:40,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 12 transitions. [2024-11-19 14:19:40,244 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:40,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2024-11-19 14:19:40,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:19:40,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:19:40,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:19:40,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:40,244 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:40,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:19:40,245 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:40,245 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:19:40,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:19:40,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:40,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:19:40,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:19:40 BoogieIcfgContainer [2024-11-19 14:19:40,251 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:19:40,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:19:40,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:19:40,252 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:19:40,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:31" (3/4) ... [2024-11-19 14:19:40,254 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:19:40,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:19:40,256 INFO L158 Benchmark]: Toolchain (without parser) took 9885.70ms. Allocated memory was 174.1MB in the beginning and 260.0MB in the end (delta: 86.0MB). Free memory was 140.2MB in the beginning and 79.1MB in the end (delta: 61.1MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2024-11-19 14:19:40,256 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 174.1MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:40,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.55ms. Allocated memory is still 174.1MB. Free memory was 140.2MB in the beginning and 121.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 14:19:40,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.73ms. Allocated memory is still 174.1MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:40,257 INFO L158 Benchmark]: Boogie Preprocessor took 49.12ms. Allocated memory is still 174.1MB. Free memory was 119.6MB in the beginning and 117.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:40,257 INFO L158 Benchmark]: RCFGBuilder took 329.97ms. Allocated memory is still 174.1MB. Free memory was 117.5MB in the beginning and 103.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 14:19:40,257 INFO L158 Benchmark]: BuchiAutomizer took 9040.84ms. Allocated memory was 174.1MB in the beginning and 260.0MB in the end (delta: 86.0MB). Free memory was 102.8MB in the beginning and 79.1MB in the end (delta: 23.7MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2024-11-19 14:19:40,258 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 260.0MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:40,259 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.40ms. Allocated memory is still 174.1MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.55ms. Allocated memory is still 174.1MB. Free memory was 140.2MB in the beginning and 121.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.73ms. Allocated memory is still 174.1MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.12ms. Allocated memory is still 174.1MB. Free memory was 119.6MB in the beginning and 117.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 329.97ms. Allocated memory is still 174.1MB. Free memory was 117.5MB in the beginning and 103.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9040.84ms. Allocated memory was 174.1MB in the beginning and 260.0MB in the end (delta: 86.0MB). Free memory was 102.8MB in the beginning and 79.1MB in the end (delta: 23.7MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 260.0MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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[~z_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[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 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 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 8.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 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/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 42 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital307 mio100 ax105 hnf100 lsp94 ukn70 mio100 lsp23 div100 bol100 ite100 ukn100 eq202 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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-19 14:19:40,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:40,482 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