./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/n.c40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loops/n.c40.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash ec147baa41deaa706a3db1972af791532e50c36ff3c23d3d92f8d6bea9417e65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:32:23,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:32:23,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:32:23,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:32:23,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:32:23,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:32:23,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:32:23,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:32:23,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:32:23,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:32:23,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:32:23,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:32:23,304 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:32:23,305 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:32:23,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:32:23,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:32:23,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:32:23,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:32:23,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:32:23,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:32:23,306 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:32:23,306 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec147baa41deaa706a3db1972af791532e50c36ff3c23d3d92f8d6bea9417e65 [2025-01-10 07:32:23,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:32:23,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:32:23,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:32:23,529 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:32:23,529 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:32:23,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c40.c [2025-01-10 07:32:24,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d691d1594/2bd004235fd842198d55c274c501bc69/FLAG6db9ce8f9 [2025-01-10 07:32:25,122 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:32:25,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/n.c40.c [2025-01-10 07:32:25,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d691d1594/2bd004235fd842198d55c274c501bc69/FLAG6db9ce8f9 [2025-01-10 07:32:25,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d691d1594/2bd004235fd842198d55c274c501bc69 [2025-01-10 07:32:25,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:32:25,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:32:25,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:32:25,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:32:25,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:32:25,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150732d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25, skipping insertion in model container [2025-01-10 07:32:25,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:32:25,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:32:25,603 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:32:25,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:32:25,634 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:32:25,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25 WrapperNode [2025-01-10 07:32:25,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:32:25,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:32:25,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:32:25,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:32:25,640 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:32:25" (1/1) ... [2025-01-10 07:32:25,646 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:32:25" (1/1) ... [2025-01-10 07:32:25,664 INFO L138 Inliner]: procedures = 12, calls = 223, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2025-01-10 07:32:25,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:32:25,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:32:25,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:32:25,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:32:25,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,686 INFO L175 MemorySlicer]: Split 215 memory accesses to 4 slices as follows [2, 8, 102, 103]. 48 percent of accesses are in the largest equivalence class. The 210 initializations are split as follows [2, 8, 100, 100]. The 2 writes are split as follows [0, 0, 0, 2]. [2025-01-10 07:32:25,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:32:25,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:32:25,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:32:25,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:32:25,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (1/1) ... [2025-01-10 07:32:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:25,738 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:32:25,740 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:32:25,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:32:25,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:32:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:32:25,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:32:25,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 07:32:25,805 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:32:25,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:32:25,970 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-01-10 07:32:25,970 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:32:25,975 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:32:25,976 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:32:25,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:25 BoogieIcfgContainer [2025-01-10 07:32:25,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:32:25,977 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:32:25,977 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:32:25,981 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:32:25,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:25,982 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:32:25" (1/3) ... [2025-01-10 07:32:25,982 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f6e2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:32:25, skipping insertion in model container [2025-01-10 07:32:25,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:25,983 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:25" (2/3) ... [2025-01-10 07:32:25,983 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f6e2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:32:25, skipping insertion in model container [2025-01-10 07:32:25,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:25,984 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:25" (3/3) ... [2025-01-10 07:32:25,985 INFO L363 chiAutomizerObserver]: Analyzing ICFG n.c40.c [2025-01-10 07:32:26,019 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:32:26,020 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:32:26,020 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:32:26,020 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:32:26,020 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:32:26,020 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:32:26,020 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:32:26,020 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:32:26,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3076923076923077) 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:32:26,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:26,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:26,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:26,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:32:26,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:26,038 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:32:26,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3076923076923077) 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:32:26,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:26,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:26,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:26,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:32:26,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:26,053 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(52, 2, 3, 1);call write~init~int#1(48, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(100, 4);~#x~0.base, ~#x~0.offset := 4, 0;call write~init~int#2(0, ~#x~0.base, ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 1 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 2 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 3 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 4 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 5 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 6 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 7 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 8 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 9 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 10 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 11 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 12 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 13 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 14 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 15 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 16 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 17 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 18 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 19 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 20 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 21 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 22 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 23 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 24 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 25 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 26 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 27 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 28 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 29 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 30 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 31 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 32 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 33 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 34 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 35 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 36 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 37 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 38 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 39 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 40 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 41 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 42 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 43 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 44 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 45 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 46 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 47 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 48 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 49 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 50 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 51 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 52 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 53 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 54 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 55 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 56 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 57 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 58 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 59 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 60 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 61 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 62 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 63 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 64 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 65 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 66 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 67 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 68 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 69 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 70 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 71 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 72 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 73 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 74 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 75 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 76 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 77 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 78 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 79 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 80 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 81 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 82 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 83 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 84 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 85 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 86 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 87 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 88 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 89 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 90 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 91 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 92 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 93 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 94 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 95 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 96 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 97 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 98 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 99 + ~#x~0.offset, 1);call #Ultimate.allocInit(100, 5);~#y~0.base, ~#y~0.offset := 5, 0;call write~init~int#3(0, ~#y~0.base, ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 1 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 2 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 3 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 4 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 5 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 6 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 7 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 8 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 9 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 10 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 11 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 12 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 13 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 14 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 15 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 16 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 17 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 18 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 19 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 20 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 21 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 22 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 23 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 24 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 25 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 26 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 27 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 28 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 29 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 30 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 31 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 32 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 33 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 34 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 35 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 36 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 37 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 38 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 39 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 40 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 41 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 42 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 43 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 44 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 45 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 46 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 47 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 48 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 49 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 50 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 51 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 52 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 53 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 54 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 55 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 56 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 57 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 58 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 59 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 60 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 61 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 62 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 63 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 64 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 65 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 66 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 67 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 68 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 69 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 70 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 71 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 72 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 73 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 74 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 75 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 76 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 77 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 78 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 79 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 80 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 81 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 82 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 83 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 84 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 85 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 86 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 87 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 88 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 89 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 90 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 91 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 92 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 93 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 94 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 95 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 96 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 97 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 98 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 99 + ~#y~0.offset, 1);~i~0 := 0;~j~0 := 0;~k~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1;havoc main_#t~nondet4#1;~k~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~i~0 := 0;" [2025-01-10 07:32:26,054 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem5#1 := read~int#2(~#x~0.base, ~#x~0.offset + ~i~0, 1);" "assume 0 != main_#t~mem5#1;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#2(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int#3(main_#t~mem6#1, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc main_#t~mem6#1;main_#t~post7#1 := ~i~0;~i~0 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-01-10 07:32:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:32:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958358289] [2025-01-10 07:32:26,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:32:26,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:32:26,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:26,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:32:26,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:32:26,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:26,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash 35849, now seen corresponding path program 1 times [2025-01-10 07:32:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105841190] [2025-01-10 07:32:26,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:26,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:26,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:26,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:26,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:26,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:26,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash 28694791, now seen corresponding path program 1 times [2025-01-10 07:32:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486586255] [2025-01-10 07:32:26,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:32:26,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:32:26,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:26,730 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:32:26,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:26,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486586255] [2025-01-10 07:32:26,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486586255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:32:26,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:32:26,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:32:26,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602967573] [2025-01-10 07:32:26,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:32:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:26,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:32:26,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:32:26,843 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.3076923076923077) 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) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:26,896 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2025-01-10 07:32:26,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 9 transitions. [2025-01-10 07:32:26,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:32:26,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2025-01-10 07:32:26,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:32:26,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:32:26,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:32:26,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:26,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:32:26,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:32:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:32:26,906 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:32:26,906 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:32:26,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:32:26,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:32:26,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:32:26,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:32:26 BoogieIcfgContainer [2025-01-10 07:32:26,915 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:32:26,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:32:26,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:32:26,917 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:32:26,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:25" (3/4) ... [2025-01-10 07:32:26,919 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:32:26,920 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:32:26,921 INFO L158 Benchmark]: Toolchain (without parser) took 1466.55ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 51.5MB in the end (delta: 61.2MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2025-01-10 07:32:26,922 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:26,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.53ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 99.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:32:26,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.07ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:32:26,923 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:26,924 INFO L158 Benchmark]: RCFGBuilder took 275.02ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 73.3MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 07:32:26,924 INFO L158 Benchmark]: BuchiAutomizer took 938.70ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 51.5MB in the end (delta: 21.8MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2025-01-10 07:32:26,924 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 142.6MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:26,926 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.22ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.53ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 99.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.07ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 275.02ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 73.3MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 938.70ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 51.5MB in the end (delta: 21.8MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 142.6MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 5 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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:32:26,941 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