./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5993f8ca278f17db67b0d89d60473315dd1639b7ed95b3e55f223aad0ab4864f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:06:02,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:06:03,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:06:03,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:06:03,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:06:03,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:06:03,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:06:03,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:06:03,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:06:03,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:06:03,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:06:03,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:06:03,042 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:06:03,042 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:06:03,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:06:03,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:06:03,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:06:03,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:06:03,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:06:03,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:06:03,046 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:06:03,046 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> 5993f8ca278f17db67b0d89d60473315dd1639b7ed95b3e55f223aad0ab4864f [2025-01-10 07:06:03,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:06:03,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:06:03,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:06:03,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:06:03,337 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:06:03,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i [2025-01-10 07:06:04,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219cce25a/d3b6646e81d84b3ba2bb52c9c98d8f3d/FLAGaaad8de1b [2025-01-10 07:06:05,078 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:06:05,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i [2025-01-10 07:06:05,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219cce25a/d3b6646e81d84b3ba2bb52c9c98d8f3d/FLAGaaad8de1b [2025-01-10 07:06:05,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219cce25a/d3b6646e81d84b3ba2bb52c9c98d8f3d [2025-01-10 07:06:05,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:06:05,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:06:05,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:06:05,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:06:05,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:06:05,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7b87fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05, skipping insertion in model container [2025-01-10 07:06:05,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:06:05,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:06:05,548 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:06:05,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:06:05,624 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:06:05,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05 WrapperNode [2025-01-10 07:06:05,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:06:05,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:06:05,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:06:05,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:06:05,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,653 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-01-10 07:06:05,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:06:05,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:06:05,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:06:05,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:06:05,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,675 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [5, 2, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 1, 2]. [2025-01-10 07:06:05,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:06:05,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:06:05,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:06:05,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:06:05,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (1/1) ... [2025-01-10 07:06:05,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:05,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:05,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:05,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:06:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:06:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:06:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:06:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:06:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:06:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:06:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:06:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:06:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:06:05,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:06:05,853 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:06:05,855 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:06:05,993 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-10 07:06:05,993 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:06:06,000 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:06:06,002 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:06:06,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:06 BoogieIcfgContainer [2025-01-10 07:06:06,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:06:06,003 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:06:06,003 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:06:06,008 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:06:06,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:06,009 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:06:05" (1/3) ... [2025-01-10 07:06:06,010 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61109692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:06:06, skipping insertion in model container [2025-01-10 07:06:06,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:06,010 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:05" (2/3) ... [2025-01-10 07:06:06,011 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61109692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:06:06, skipping insertion in model container [2025-01-10 07:06:06,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:06,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:06" (3/3) ... [2025-01-10 07:06:06,013 INFO L363 chiAutomizerObserver]: Analyzing ICFG a.10-alloca.i [2025-01-10 07:06:06,056 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:06:06,056 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:06:06,057 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:06:06,057 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:06:06,057 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:06:06,057 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:06:06,057 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:06:06,058 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:06:06,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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) [2025-01-10 07:06:06,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:06,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:06,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:06,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:06,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:06:06,083 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:06:06,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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) [2025-01-10 07:06:06,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:06,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:06,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:06,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:06,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:06:06,089 INFO L752 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~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#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_#t~mem11#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#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2025-01-10 07:06:06,089 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" [2025-01-10 07:06:06,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:06:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:06,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249225188] [2025-01-10 07:06:06,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:06,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:06,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:06,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:06,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:06,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:06,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:06,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:06,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:06,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:06,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1111335, now seen corresponding path program 1 times [2025-01-10 07:06:06,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:06,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546407017] [2025-01-10 07:06:06,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:06,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:06,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:06,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:06,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:06,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:06,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:06,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:06,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:06,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:06,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:06,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 889538537, now seen corresponding path program 1 times [2025-01-10 07:06:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861644266] [2025-01-10 07:06:06,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:06,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:06,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:06,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:06,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:06,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:06,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:06,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:06,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:07,265 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:06:07,266 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:06:07,266 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:06:07,266 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:06:07,267 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:06:07,267 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:07,267 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:06:07,267 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:06:07,267 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.10-alloca.i_Iteration1_Lasso [2025-01-10 07:06:07,267 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:06:07,268 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:06:07,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:07,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:08,102 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:06:08,105 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:06:08,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:08,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:08,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:08,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:06:08,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:08,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:08,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:08,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:08,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:08,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:08,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:08,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:08,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:08,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:06:08,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:08,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:08,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:06:08,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:08,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:08,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:08,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:08,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:08,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:08,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:08,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:08,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:08,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:06:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:08,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:08,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:08,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:06:08,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:08,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:08,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:08,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:08,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:08,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:08,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:08,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:08,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:08,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:06:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:08,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:06:08,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:08,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:08,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:08,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:08,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:08,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:08,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:08,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:08,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:08,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:06:08,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:08,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:08,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:08,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:06:08,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:08,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:08,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:08,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:08,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:08,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:08,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:08,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:08,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:06:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:08,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:08,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:06:08,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:08,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:08,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:08,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:08,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:08,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:08,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:08,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:06:08,301 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:06:08,303 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-01-10 07:06:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:08,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:08,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:06:08,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:06:08,326 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:06:08,327 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:06:08,327 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1, v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = -1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 Supporting invariants [] [2025-01-10 07:06:08,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:06:08,411 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2025-01-10 07:06:08,418 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:06:08,419 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:06:08,419 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-01-10 07:06:08,420 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-10 07:06:08,420 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-10 07:06:08,420 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-01-10 07:06:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:08,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:08,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:08,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:08,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:08,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:06:08,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:08,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:08,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:08,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:08,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:08,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:06:08,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:08,555 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 [2025-01-10 07:06:08,557 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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) 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) [2025-01-10 07:06:08,611 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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). 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 28 states and 34 transitions. Complement of second has 8 states. [2025-01-10 07:06:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:08,618 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) [2025-01-10 07:06:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-01-10 07:06:08,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 07:06:08,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:08,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 6 letters. Loop has 4 letters. [2025-01-10 07:06:08,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:08,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 8 letters. [2025-01-10 07:06:08,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:08,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2025-01-10 07:06:08,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:08,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 14 states and 17 transitions. [2025-01-10 07:06:08,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:06:08,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:06:08,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2025-01-10 07:06:08,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:08,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2025-01-10 07:06:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-10 07:06:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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) [2025-01-10 07:06:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-01-10 07:06:08,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:08,657 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:08,657 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:06:08,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2025-01-10 07:06:08,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:08,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:08,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:08,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:06:08,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:06:08,659 INFO L752 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~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#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_#t~mem11#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#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem10#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1;" [2025-01-10 07:06:08,660 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" [2025-01-10 07:06:08,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash 889538539, now seen corresponding path program 1 times [2025-01-10 07:06:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398180844] [2025-01-10 07:06:08,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:08,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:08,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:08,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:08,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:08,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:08,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:08,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:08,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:08,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:08,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1111335, now seen corresponding path program 2 times [2025-01-10 07:06:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591495840] [2025-01-10 07:06:08,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:08,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:08,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:08,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:06:08,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:08,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:08,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:08,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:08,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:08,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:08,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 536623121, now seen corresponding path program 1 times [2025-01-10 07:06:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:08,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166147939] [2025-01-10 07:06:08,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:08,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:06:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:06:08,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:08,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:09,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:06:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166147939] [2025-01-10 07:06:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166147939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:06:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001477285] [2025-01-10 07:06:09,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:06:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:09,202 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:06:09,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 07:06:09,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:06:09,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:06:09,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:09,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:09,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:06:09,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:09,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-01-10 07:06:09,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 07:06:09,381 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 [2025-01-10 07:06:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:09,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:06:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:09,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001477285] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:06:09,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:06:09,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-10 07:06:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189795487] [2025-01-10 07:06:09,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:06:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:09,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 07:06:09,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 07:06:09,564 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:09,693 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-01-10 07:06:09,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-01-10 07:06:09,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:09,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2025-01-10 07:06:09,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:06:09,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:06:09,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-01-10 07:06:09,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:09,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:06:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-01-10 07:06:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2025-01-10 07:06:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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) [2025-01-10 07:06:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-01-10 07:06:09,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:06:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 07:06:09,696 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:06:09,696 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:06:09,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-01-10 07:06:09,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:09,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:09,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:09,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:06:09,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:06:09,697 INFO L752 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~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#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_#t~mem11#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#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:09,697 INFO L754 eck$LassoCheckResult]: Loop: "assume !(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem10#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1;" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:06:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294348615] [2025-01-10 07:06:09,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:09,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:09,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:09,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:09,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:09,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:09,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:09,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:09,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:09,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:09,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1204697, now seen corresponding path program 1 times [2025-01-10 07:06:09,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:09,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559727569] [2025-01-10 07:06:09,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:09,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:09,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:09,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:09,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:09,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:09,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:09,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:09,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:09,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:09,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:09,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890939, now seen corresponding path program 2 times [2025-01-10 07:06:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830059783] [2025-01-10 07:06:09,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:09,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:06:09,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:09,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:06:09,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:09,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:09,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:09,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:09,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:09,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:09,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:10,425 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:06:10,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:06:10,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:06:10,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:06:10,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:06:10,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:10,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:06:10,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:06:10,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.10-alloca.i_Iteration3_Lasso [2025-01-10 07:06:10,426 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:06:10,426 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:06:10,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:10,977 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:06:10,978 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:06:10,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:10,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:10,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:06:10,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:10,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:10,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:10,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:10,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:10,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:10,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:10,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:11,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:11,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:11,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:11,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:11,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:11,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:06:11,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:11,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:11,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:11,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:11,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:11,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:11,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:11,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:11,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:11,042 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:11,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:06:11,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:11,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:11,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:11,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:11,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:11,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:11,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:11,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:11,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:11,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:11,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:11,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:06:11,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:11,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:11,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:11,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:11,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:11,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:11,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:11,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:11,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:06:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:11,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:11,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:06:11,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:11,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:11,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:11,128 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 07:06:11,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:11,140 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-01-10 07:06:11,140 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-01-10 07:06:11,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:06:11,206 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-01-10 07:06:11,206 INFO L444 ModelExtractionUtils]: 0 out of 26 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-01-10 07:06:11,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:11,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:11,210 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:11,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:06:11,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:06:11,225 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-01-10 07:06:11,225 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:06:11,225 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2, v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2) = 2*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 - 2*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2 + 1 Supporting invariants [] [2025-01-10 07:06:11,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:06:11,271 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2025-01-10 07:06:11,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-10 07:06:11,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-10 07:06:11,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-01-10 07:06:11,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:06:11,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:06:11,273 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-01-10 07:06:11,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:11,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 07:06:11,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:11,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:11,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:11,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:11,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:06:11,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:11,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:11,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:11,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:11,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:11,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:06:11,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:11,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-01-10 07:06:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:11,425 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 [2025-01-10 07:06:11,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:11,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 28 transitions. Complement of second has 7 states. [2025-01-10 07:06:11,445 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 [2025-01-10 07:06:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-01-10 07:06:11,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. [2025-01-10 07:06:11,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:11,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 07:06:11,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:11,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 8 letters. [2025-01-10 07:06:11,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:11,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2025-01-10 07:06:11,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:11,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 14 states and 15 transitions. [2025-01-10 07:06:11,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:06:11,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:06:11,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2025-01-10 07:06:11,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:11,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 07:06:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2025-01-10 07:06:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2025-01-10 07:06:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-01-10 07:06:11,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 07:06:11,449 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 07:06:11,449 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:06:11,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-01-10 07:06:11,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:06:11,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:11,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:11,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-01-10 07:06:11,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:06:11,450 INFO L752 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~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#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_#t~mem11#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#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:11,450 INFO L754 eck$LassoCheckResult]: Loop: "assume !(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem7#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem10#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1;" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890877, now seen corresponding path program 2 times [2025-01-10 07:06:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224979969] [2025-01-10 07:06:11,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:11,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:06:11,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:11,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:06:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:11,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:11,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:11,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:11,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:11,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:11,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:11,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1204697, now seen corresponding path program 2 times [2025-01-10 07:06:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:11,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179226108] [2025-01-10 07:06:11,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:11,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:11,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:11,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:06:11,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:11,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:11,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:11,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:11,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:11,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:11,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash -601810667, now seen corresponding path program 2 times [2025-01-10 07:06:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885568350] [2025-01-10 07:06:11,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:11,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:06:11,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:06:11,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:06:11,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885568350] [2025-01-10 07:06:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885568350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:06:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786112806] [2025-01-10 07:06:11,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:06:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:11,782 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:06:11,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 07:06:11,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:06:11,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:06:11,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:06:11,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:11,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 07:06:11,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:11,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-01-10 07:06:11,941 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 21 treesize of output 13 [2025-01-10 07:06:11,946 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 17 treesize of output 9 [2025-01-10 07:06:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:11,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:06:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786112806] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:06:12,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:06:12,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-10 07:06:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534906162] [2025-01-10 07:06:12,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:06:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:12,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 07:06:12,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 07:06:12,097 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:12,180 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-01-10 07:06:12,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 13 transitions. [2025-01-10 07:06:12,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:06:12,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2025-01-10 07:06:12,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:06:12,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:06:12,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:06:12,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:06:12,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:12,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:06:12,184 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:12,184 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:06:12,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:06:12,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:06:12,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:06:12,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:06:12 BoogieIcfgContainer [2025-01-10 07:06:12,191 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:06:12,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:06:12,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:06:12,192 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:06:12,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:06" (3/4) ... [2025-01-10 07:06:12,194 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:06:12,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:06:12,196 INFO L158 Benchmark]: Toolchain (without parser) took 6887.66ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 102.6MB in the end (delta: 20.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2025-01-10 07:06:12,196 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:12,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.96ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 106.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:06:12,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.42ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 105.6MB in the end (delta: 853.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:12,196 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 103.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:12,196 INFO L158 Benchmark]: RCFGBuilder took 313.74ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 91.4MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:06:12,197 INFO L158 Benchmark]: BuchiAutomizer took 6188.23ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 102.7MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:12,197 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 102.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:12,198 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.96ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 106.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.42ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 105.6MB in the end (delta: 853.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 103.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 313.74ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 91.4MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6188.23ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 102.7MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 102.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~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[~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[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 18 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax108 hnf100 lsp91 ukn64 mio100 lsp26 div100 bol100 ite100 ukn100 eq160 hnf90 smp100 dnf122 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 116ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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! [2025-01-10 07:06:12,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:12,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 07:06:12,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE