./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f 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/a.01-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 c994ac84f704310f86b6de2d86d8b7f67d4998f02f9723cbf53fa381c3e606ea --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:57:27,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:57:27,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-12 20:57:27,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:57:27,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:57:27,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:57:27,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:57:27,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:57:27,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:57:27,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:57:27,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:57:27,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:57:27,148 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:57:27,148 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 20:57:27,148 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 20:57:27,149 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 20:57:27,149 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 20:57:27,150 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 20:57:27,150 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 20:57:27,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:57:27,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 20:57:27,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:57:27,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:57:27,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 20:57:27,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 20:57:27,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 20:57:27,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:57:27,154 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:57:27,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:57:27,155 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 20:57:27,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:57:27,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:57:27,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:57:27,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:57:27,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:57:27,157 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 20:57:27,157 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 -> c994ac84f704310f86b6de2d86d8b7f67d4998f02f9723cbf53fa381c3e606ea [2024-11-12 20:57:27,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:57:27,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:57:27,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:57:27,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:57:27,429 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:57:27,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i [2024-11-12 20:57:28,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:57:29,073 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:57:29,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i [2024-11-12 20:57:29,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81839eb41/0708c06e33ee4993a94416e50325b554/FLAG000ab42ef [2024-11-12 20:57:29,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81839eb41/0708c06e33ee4993a94416e50325b554 [2024-11-12 20:57:29,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:57:29,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:57:29,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:57:29,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:57:29,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:57:29,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771a6032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29, skipping insertion in model container [2024-11-12 20:57:29,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:57:29,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:57:29,479 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:57:29,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:57:29,551 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:57:29,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29 WrapperNode [2024-11-12 20:57:29,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:57:29,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:57:29,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:57:29,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:57:29,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,596 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-12 20:57:29,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:57:29,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:57:29,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:57:29,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:57:29,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,627 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [1, 3, 2]. [2024-11-12 20:57:29,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:57:29,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:57:29,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:57:29,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:57:29,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (1/1) ... [2024-11-12 20:57:29,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:29,679 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-12 20:57:29,685 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-12 20:57:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:57:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:57:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:57:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:57:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:57:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:57:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:57:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:57:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:57:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:57:29,822 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:57:29,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:57:29,963 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 20:57:29,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:57:29,977 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:57:29,977 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 20:57:29,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:57:29 BoogieIcfgContainer [2024-11-12 20:57:29,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:57:29,978 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 20:57:29,979 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 20:57:29,983 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 20:57:29,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:57:29,985 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 08:57:29" (1/3) ... [2024-11-12 20:57:29,985 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64b0a408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:57:29, skipping insertion in model container [2024-11-12 20:57:29,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:57:29,986 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:57:29" (2/3) ... [2024-11-12 20:57:29,986 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64b0a408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:57:29, skipping insertion in model container [2024-11-12 20:57:29,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:57:29,986 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:57:29" (3/3) ... [2024-11-12 20:57:29,987 INFO L332 chiAutomizerObserver]: Analyzing ICFG a.01-alloca.i [2024-11-12 20:57:30,047 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 20:57:30,048 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 20:57:30,048 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 20:57:30,048 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 20:57:30,048 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 20:57:30,048 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 20:57:30,049 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 20:57:30,049 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 20:57:30,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:30,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:57:30,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:57:30,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:57:30,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:57:30,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:57:30,071 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 20:57:30,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:30,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:57:30,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:57:30,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:57:30,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:57:30,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-12 20:57:30,078 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2024-11-12 20:57:30,079 INFO L749 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !true;" "call test_fun_#t~mem9#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~mem9#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" [2024-11-12 20:57:30,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 20:57:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:30,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981111009] [2024-11-12 20:57:30,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:30,218 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:30,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:30,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2024-11-12 20:57:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368228564] [2024-11-12 20:57:30,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:57:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368228564] [2024-11-12 20:57:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368228564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:57:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876463330] [2024-11-12 20:57:30,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:30,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:57:30,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:30,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:57:30,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:57:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:30,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 20:57:30,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:30,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:57:30,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876463330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:57:30,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:57:30,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 20:57:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808734252] [2024-11-12 20:57:30,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:57:30,424 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:57:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:57:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:57:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:57:30,456 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:57:30,461 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-11-12 20:57:30,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2024-11-12 20:57:30,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:57:30,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2024-11-12 20:57:30,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-12 20:57:30,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-12 20:57:30,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-11-12 20:57:30,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:57:30,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-12 20:57:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-11-12 20:57:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-12 20:57:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-11-12 20:57:30,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-12 20:57:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:57:30,498 INFO L426 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-12 20:57:30,499 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 20:57:30,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-11-12 20:57:30,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:57:30,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:57:30,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:57:30,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:57:30,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-12 20:57:30,500 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2024-11-12 20:57:30,502 INFO L749 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;" "call test_fun_#t~mem9#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~mem9#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" [2024-11-12 20:57:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-12 20:57:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945818102] [2024-11-12 20:57:30,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:30,552 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:30,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:30,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2024-11-12 20:57:30,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:30,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230024026] [2024-11-12 20:57:30,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:30,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:57:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230024026] [2024-11-12 20:57:30,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230024026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:57:30,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704422579] [2024-11-12 20:57:30,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:30,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:57:30,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:30,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:57:30,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:57:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:57:30,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:30,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:57:31,015 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 15 treesize of output 7 [2024-11-12 20:57:31,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:57:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704422579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:57:31,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:57:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-12 20:57:31,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417818456] [2024-11-12 20:57:31,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:57:31,116 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:57:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:57:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 20:57:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:57:31,118 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:57:31,188 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2024-11-12 20:57:31,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-11-12 20:57:31,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 20:57:31,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2024-11-12 20:57:31,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-12 20:57:31,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-12 20:57:31,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2024-11-12 20:57:31,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:57:31,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-12 20:57:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2024-11-12 20:57:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-12 20:57:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-12 20:57:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-12 20:57:31,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-12 20:57:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:57:31,195 INFO L426 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-12 20:57:31,196 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 20:57:31,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-12 20:57:31,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 20:57:31,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:57:31,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:57:31,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:57:31,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2024-11-12 20:57:31,200 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2024-11-12 20:57:31,200 INFO L749 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;" "call test_fun_#t~mem9#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~mem9#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" [2024-11-12 20:57:31,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-12 20:57:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783429562] [2024-11-12 20:57:31,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:31,235 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:31,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2024-11-12 20:57:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:31,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598688939] [2024-11-12 20:57:31,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:31,278 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:31,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:31,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 1 times [2024-11-12 20:57:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149462692] [2024-11-12 20:57:31,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:31,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:31,338 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:31,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:32,058 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:57:32,059 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:57:32,059 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:57:32,059 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:57:32,059 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:57:32,060 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:32,060 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:57:32,060 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:57:32,060 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.01-alloca.i_Iteration3_Lasso [2024-11-12 20:57:32,060 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:57:32,060 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:57:32,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:32,994 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:57:32,998 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:57:32,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:32,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,001 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-12 20:57:33,003 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-12 20:57:33,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:33,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,034 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-12 20:57:33,035 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-12 20:57:33,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:33,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,062 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-12 20:57:33,063 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-12 20:57:33,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:33,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,090 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-12 20:57:33,091 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-12 20:57:33,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-12 20:57:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,117 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-12 20:57:33,118 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-12 20:57:33,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-12 20:57:33,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,142 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-12 20:57:33,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,144 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-12 20:57:33,145 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-12 20:57:33,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:33,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:33,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-12 20:57:33,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,179 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-12 20:57:33,180 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-12 20:57:33,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:33,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,206 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-12 20:57:33,207 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-12 20:57:33,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,234 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-12 20:57:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,237 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-12 20:57:33,238 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-12 20:57:33,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,268 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-12 20:57:33,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,270 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-12 20:57:33,270 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-12 20:57:33,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:33,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:33,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,299 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-12 20:57:33,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,300 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-12 20:57:33,301 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-12 20:57:33,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:33,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:33,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:33,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:33,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,325 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-12 20:57:33,326 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-12 20:57:33,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:33,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:33,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,353 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-12 20:57:33,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,355 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-12 20:57:33,356 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-12 20:57:33,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:33,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:33,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-12 20:57:33,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,391 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-12 20:57:33,392 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-12 20:57:33,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:33,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:33,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-12 20:57:33,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,433 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-12 20:57:33,435 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-12 20:57:33,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:33,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:33,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:33,466 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-12 20:57:33,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,468 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-12 20:57:33,470 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-12 20:57:33,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:33,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:33,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:33,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:33,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:33,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:33,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:33,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:57:33,520 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-12 20:57:33,520 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-12 20:57:33,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:33,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:33,524 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-12 20:57:33,526 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-12 20:57:33,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:57:33,540 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:57:33,540 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:57:33,541 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [] [2024-11-12 20:57:33,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:33,614 INFO L156 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2024-11-12 20:57:33,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-12 20:57:33,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-12 20:57:33,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-12 20:57:33,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:33,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:57:33,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:33,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 20:57:33,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 20:57:33,757 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-12 20:57:33,758 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:33,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 19 transitions. Complement of second has 6 states. [2024-11-12 20:57:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-12 20:57:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-12 20:57:33,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 7 letters. [2024-11-12 20:57:33,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:33,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 7 letters. [2024-11-12 20:57:33,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:33,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 14 letters. [2024-11-12 20:57:33,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:33,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2024-11-12 20:57:33,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:57:33,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 18 transitions. [2024-11-12 20:57:33,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-12 20:57:33,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-12 20:57:33,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2024-11-12 20:57:33,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:57:33,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-12 20:57:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2024-11-12 20:57:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-11-12 20:57:33,830 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-12 20:57:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-12 20:57:33,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-12 20:57:33,830 INFO L426 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-12 20:57:33,830 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 20:57:33,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-12 20:57:33,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:57:33,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:57:33,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:57:33,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 20:57:33,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:57:33,831 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2024-11-12 20:57:33,832 INFO L749 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2024-11-12 20:57:33,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-11-12 20:57:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:33,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140035964] [2024-11-12 20:57:33,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:33,857 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:33,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:33,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2024-11-12 20:57:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:33,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908830983] [2024-11-12 20:57:33,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:33,881 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:33,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:33,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2024-11-12 20:57:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071241130] [2024-11-12 20:57:33,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:33,901 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:33,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:34,004 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-12 20:57:34,453 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:57:34,453 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:57:34,453 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:57:34,453 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:57:34,453 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:57:34,453 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:34,453 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:57:34,454 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:57:34,454 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.01-alloca.i_Iteration4_Lasso [2024-11-12 20:57:34,454 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:57:34,454 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:57:34,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:34,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:35,053 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:57:35,054 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:57:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:35,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:35,055 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-12 20:57:35,056 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-12 20:57:35,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:35,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:35,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:35,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:35,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:35,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:35,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:35,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:35,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:35,078 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-12 20:57:35,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:35,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:35,079 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-12 20:57:35,081 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-12 20:57:35,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:35,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:35,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:35,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:35,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:35,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:35,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:35,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:35,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:35,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:35,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:35,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:35,104 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-12 20:57:35,106 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-12 20:57:35,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:35,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:35,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:35,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:35,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:35,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:35,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:35,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:35,137 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-12 20:57:35,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:35,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:35,139 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-12 20:57:35,140 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-12 20:57:35,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:35,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:35,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:35,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:35,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:35,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:35,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:35,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:57:35,182 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-12 20:57:35,182 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-12 20:57:35,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:35,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:35,184 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-12 20:57:35,185 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-12 20:57:35,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:57:35,200 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:57:35,200 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:57:35,200 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_2 Supporting invariants [] [2024-11-12 20:57:35,215 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-12 20:57:35,272 INFO L156 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2024-11-12 20:57:35,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-12 20:57:35,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-12 20:57:35,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-12 20:57:35,278 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 20:57:35,278 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-12 20:57:35,278 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-12 20:57:35,318 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-12 20:57:35,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:35,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:57:35,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:35,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 20:57:35,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:35,384 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-12 20:57:35,385 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-12 20:57:35,385 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:35,440 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 39 transitions. Complement of second has 8 states. [2024-11-12 20:57:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-12 20:57:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2024-11-12 20:57:35,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-12 20:57:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:35,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-12 20:57:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:35,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-12 20:57:35,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:35,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-11-12 20:57:35,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:57:35,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 27 transitions. [2024-11-12 20:57:35,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-12 20:57:35,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-12 20:57:35,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2024-11-12 20:57:35,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:57:35,445 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-12 20:57:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2024-11-12 20:57:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2024-11-12 20:57:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-12 20:57:35,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-12 20:57:35,447 INFO L426 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-12 20:57:35,447 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 20:57:35,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-11-12 20:57:35,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:57:35,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:57:35,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:57:35,448 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-12 20:57:35,448 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:57:35,448 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;" "call test_fun_#t~mem9#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~mem9#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2024-11-12 20:57:35,449 INFO L749 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2024-11-12 20:57:35,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2038480497, now seen corresponding path program 2 times [2024-11-12 20:57:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051191709] [2024-11-12 20:57:35,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:35,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:57:35,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051191709] [2024-11-12 20:57:35,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051191709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:57:35,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871538476] [2024-11-12 20:57:35,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:57:35,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:57:35,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:35,721 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:57:35,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-12 20:57:35,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:57:35,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:57:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-12 20:57:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742228684] [2024-11-12 20:57:35,779 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:57:35,779 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:57:35,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:35,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2024-11-12 20:57:35,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450798714] [2024-11-12 20:57:35,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:35,784 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:35,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:57:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 20:57:35,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:57:35,845 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 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-12 20:57:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:57:35,924 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-12 20:57:35,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-11-12 20:57:35,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:57:35,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 30 transitions. [2024-11-12 20:57:35,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-12 20:57:35,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-12 20:57:35,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2024-11-12 20:57:35,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:57:35,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-12 20:57:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2024-11-12 20:57:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2024-11-12 20:57:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 20:57:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-12 20:57:35,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-12 20:57:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:57:35,930 INFO L426 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-12 20:57:35,930 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 20:57:35,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2024-11-12 20:57:35,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:57:35,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:57:35,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:57:35,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 20:57:35,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:57:35,932 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;" "call test_fun_#t~mem9#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~mem9#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" "call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call write~int#1(0, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2024-11-12 20:57:35,932 INFO L749 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume !!(test_fun_#t~mem6#1 < test_fun_#t~mem7#1);havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem8#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2024-11-12 20:57:35,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 3 times [2024-11-12 20:57:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378752769] [2024-11-12 20:57:35,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:35,956 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:35,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 3 times [2024-11-12 20:57:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334387332] [2024-11-12 20:57:35,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:35,983 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:35,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:35,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash -713568913, now seen corresponding path program 4 times [2024-11-12 20:57:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:57:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734195172] [2024-11-12 20:57:35,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:57:35,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:57:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:36,009 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:57:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:57:36,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:57:37,158 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:57:37,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:57:37,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:57:37,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:57:37,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:57:37,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:57:37,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:57:37,159 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.01-alloca.i_Iteration6_Lasso [2024-11-12 20:57:37,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:57:37,159 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:57:37,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:57:37,699 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:57:37,700 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:57:37,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,702 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-12 20:57:37,704 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-12 20:57:37,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:37,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:37,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:37,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:37,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,726 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-12 20:57:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,727 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-12 20:57:37,729 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-12 20:57:37,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:37,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:37,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:37,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:37,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,754 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-12 20:57:37,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,756 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-12 20:57:37,757 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-12 20:57:37,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:57:37,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:37,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:37,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:37,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,780 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-12 20:57:37,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,781 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-12 20:57:37,782 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-12 20:57:37,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:37,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:37,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:37,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-12 20:57:37,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,812 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-12 20:57:37,813 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-12 20:57:37,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:57:37,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:37,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:37,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,838 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-12 20:57:37,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,839 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-12 20:57:37,840 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-12 20:57:37,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:57:37,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:37,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:37,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,864 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-12 20:57:37,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,865 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-12 20:57:37,866 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-12 20:57:37,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:37,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:37,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:37,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:37,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:37,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,888 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-12 20:57:37,889 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-12 20:57:37,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:37,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:57:37,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:57:37,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:57:37,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,911 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-12 20:57:37,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,912 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-12 20:57:37,913 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-12 20:57:37,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:37,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:37,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:37,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-12 20:57:37,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,939 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:57:37,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-12 20:57:37,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 20:57:37,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:37,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:37,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:57:37,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-12 20:57:37,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:37,973 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:57:37,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-12 20:57:37,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:57:37,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:57:37,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:57:37,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:57:37,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:57:37,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:57:37,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:57:37,997 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:57:38,008 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-12 20:57:38,009 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-12 20:57:38,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:57:38,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:57:38,010 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:57:38,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-12 20:57:38,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:57:38,021 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:57:38,022 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:57:38,022 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3, 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)_3) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 - 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)_3 Supporting invariants [] [2024-11-12 20:57:38,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:38,064 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2024-11-12 20:57:38,065 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-12 20:57:38,065 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-12 20:57:38,065 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-12 20:57:38,066 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 20:57:38,066 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-12 20:57:38,066 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-12 20:57:38,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:38,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:57:38,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:38,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:57:38,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:38,143 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-12 20:57:38,144 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-12 20:57:38,144 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:38,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 38 transitions. Complement of second has 7 states. [2024-11-12 20:57:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-12 20:57:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-12 20:57:38,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2024-11-12 20:57:38,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:38,173 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:57:38,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:38,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-12 20:57:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:38,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:57:38,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:38,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:57:38,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:38,292 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-12 20:57:38,293 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 20:57:38,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:38,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 38 transitions. Complement of second has 7 states. [2024-11-12 20:57:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-12 20:57:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-12 20:57:38,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2024-11-12 20:57:38,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:38,316 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:57:38,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:57:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:38,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:57:38,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:57:38,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:57:38,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:57:38,404 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-12 20:57:38,405 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 20:57:38,405 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:38,429 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 40 transitions. Complement of second has 6 states. [2024-11-12 20:57:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-12 20:57:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:57:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-12 20:57:38,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 2 letters. [2024-11-12 20:57:38,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:38,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-12 20:57:38,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:38,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-12 20:57:38,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:57:38,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2024-11-12 20:57:38,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 20:57:38,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2024-11-12 20:57:38,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-12 20:57:38,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-12 20:57:38,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-12 20:57:38,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:57:38,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:57:38,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:57:38,434 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:57:38,434 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 20:57:38,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-12 20:57:38,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 20:57:38,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-12 20:57:38,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 08:57:38 BoogieIcfgContainer [2024-11-12 20:57:38,441 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 20:57:38,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:57:38,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:57:38,442 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:57:38,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:57:29" (3/4) ... [2024-11-12 20:57:38,444 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 20:57:38,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:57:38,446 INFO L158 Benchmark]: Toolchain (without parser) took 9340.86ms. Allocated memory was 176.2MB in the beginning and 253.8MB in the end (delta: 77.6MB). Free memory was 119.9MB in the beginning and 192.4MB in the end (delta: -72.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-12 20:57:38,446 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 176.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:57:38,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.72ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 100.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 20:57:38,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.08ms. Allocated memory is still 176.2MB. Free memory was 100.9MB in the beginning and 98.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:57:38,447 INFO L158 Benchmark]: Boogie Preprocessor took 48.82ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 97.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:57:38,447 INFO L158 Benchmark]: RCFGBuilder took 330.95ms. Allocated memory is still 176.2MB. Free memory was 96.8MB in the beginning and 144.0MB in the end (delta: -47.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-12 20:57:38,448 INFO L158 Benchmark]: BuchiAutomizer took 8462.32ms. Allocated memory was 176.2MB in the beginning and 253.8MB in the end (delta: 77.6MB). Free memory was 143.9MB in the beginning and 192.4MB in the end (delta: -48.5MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-12 20:57:38,448 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 253.8MB. Free memory is still 192.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:57:38,449 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.46ms. Allocated memory is still 176.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.72ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 100.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.08ms. Allocated memory is still 176.2MB. Free memory was 100.9MB in the beginning and 98.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.82ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 97.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 330.95ms. Allocated memory is still 176.2MB. Free memory was 96.8MB in the beginning and 144.0MB in the end (delta: -47.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 8462.32ms. Allocated memory was 176.2MB in the beginning and 253.8MB in the end (delta: 77.6MB). Free memory was 143.9MB in the beginning and 192.4MB in the end (delta: -48.5MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 253.8MB. Free memory is still 192.4MB. 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#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 7.3s. 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, 12 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 43 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax108 hnf100 lsp91 ukn74 mio100 lsp24 div100 bol100 ite100 ukn100 eq167 hnf89 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms 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-12 20:57:38,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:38,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:38,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 20:57:39,071 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