./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:47:14,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:47:14,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:47:14,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:47:14,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:47:14,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:47:14,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:47:14,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:47:14,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:47:14,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:47:14,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:47:14,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:47:14,418 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:47:14,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:47:14,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:47:14,419 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:47:14,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:47:14,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:47:14,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:47:14,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:47:14,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:47:14,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:47:14,419 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:47:14,419 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/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 -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2025-03-09 06:47:14,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:47:14,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:47:14,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:47:14,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:47:14,643 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:47:14,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-03-09 06:47:15,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9df3ef3/7c97f8ec2017467ea1815450e75b0022/FLAGc6d7e83af [2025-03-09 06:47:16,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:47:16,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-03-09 06:47:16,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9df3ef3/7c97f8ec2017467ea1815450e75b0022/FLAGc6d7e83af [2025-03-09 06:47:16,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9df3ef3/7c97f8ec2017467ea1815450e75b0022 [2025-03-09 06:47:16,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:47:16,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:47:16,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:16,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:47:16,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:47:16,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f295f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16, skipping insertion in model container [2025-03-09 06:47:16,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:47:16,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:16,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:47:16,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:16,505 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:47:16,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16 WrapperNode [2025-03-09 06:47:16,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:16,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:16,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:47:16,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:47:16,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,523 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-03-09 06:47:16,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:16,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:47:16,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:47:16,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:47:16,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,537 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 4, 4, 3]. 27 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 11 writes are split as follows [3, 3, 3, 2]. [2025-03-09 06:47:16,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:47:16,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:47:16,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:47:16,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:47:16,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (1/1) ... [2025-03-09 06:47:16,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:47:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:47:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:47:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:47:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:47:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:47:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:47:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:47:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:47:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:47:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:47:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:47:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:47:16,644 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:47:16,645 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:47:16,799 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: call ULTIMATE.dealloc(main_#t~malloc0#1.base, main_#t~malloc0#1.offset);havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2025-03-09 06:47:16,807 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 06:47:16,807 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:47:16,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:47:16,819 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:47:16,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:16 BoogieIcfgContainer [2025-03-09 06:47:16,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:47:16,821 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:47:16,821 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:47:16,825 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:47:16,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:16,826 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:47:16" (1/3) ... [2025-03-09 06:47:16,827 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22b6ca41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:16, skipping insertion in model container [2025-03-09 06:47:16,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:16,827 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:16" (2/3) ... [2025-03-09 06:47:16,827 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22b6ca41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:16, skipping insertion in model container [2025-03-09 06:47:16,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:16,828 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:16" (3/3) ... [2025-03-09 06:47:16,828 INFO L363 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2025-03-09 06:47:16,863 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:47:16,863 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:47:16,863 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:47:16,863 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:47:16,864 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:47:16,864 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:47:16,864 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:47:16,864 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:47:16,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:16,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:16,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:16,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:16,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:47:16,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:16,884 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:47:16,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:16,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:16,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:16,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:16,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:47:16,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:16,888 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-09 06:47:16,889 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-03-09 06:47:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-09 06:47:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:16,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035474660] [2025-03-09 06:47:16,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:16,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:17,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:17,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:17,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:17,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:17,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:17,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:17,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 1 times [2025-03-09 06:47:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834154641] [2025-03-09 06:47:17,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:17,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:17,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:17,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:17,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:17,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:17,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:17,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:17,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash 44819525, now seen corresponding path program 1 times [2025-03-09 06:47:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611617529] [2025-03-09 06:47:17,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:17,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:17,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:17,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:17,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:17,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:17,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:17,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:17,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:17,924 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:17,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:17,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:17,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:17,924 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:17,924 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:17,925 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:17,925 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:17,925 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2025-03-09 06:47:17,925 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:17,925 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:17,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:17,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:17,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:17,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:17,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:18,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:18,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:18,674 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:18,676 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:18,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:47:18,682 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-03-09 06:47:18,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:18,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:18,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:18,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:47:18,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:47:18,723 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-03-09 06:47:18,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:18,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:18,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:18,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:47:18,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:47:18,747 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-03-09 06:47:18,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:18,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:18,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:18,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:47:18,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:47:18,773 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-03-09 06:47:18,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:18,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:18,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:47:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,803 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:47:18,809 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-03-09 06:47:18,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:18,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:18,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 06:47:18,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:47:18,847 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-03-09 06:47:18,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:18,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:18,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:47:18,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:47:18,876 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-03-09 06:47:18,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:18,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:18,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:18,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,902 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:47:18,905 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-03-09 06:47:18,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:18,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:18,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:18,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:18,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,944 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:18,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:47:18,946 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-03-09 06:47:18,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:18,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:18,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:18,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:18,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:18,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:18,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:18,990 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-09 06:47:18,992 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:47:18,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:18,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:19,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:47:19,002 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:19,017 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:47:19,017 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:19,017 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2025-03-09 06:47:19,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:19,115 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2025-03-09 06:47:19,122 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:47:19,123 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:47:19,123 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-03-09 06:47:19,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:19,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:19,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:19,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:19,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:19,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:19,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:19,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:19,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:19,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:47:19,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:19,228 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-03-09 06:47:19,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) 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-03-09 06:47:19,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) 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) Result 25 states and 33 transitions. Complement of second has 8 states. [2025-03-09 06:47:19,268 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-03-09 06:47:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) 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-03-09 06:47:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-03-09 06:47:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-09 06:47:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-09 06:47:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-09 06:47:19,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:19,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-03-09 06:47:19,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:19,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2025-03-09 06:47:19,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:47:19,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:47:19,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-03-09 06:47:19,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:19,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:47:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-03-09 06:47:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-09 06:47:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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-03-09 06:47:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-09 06:47:19,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:47:19,306 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:47:19,306 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:47:19,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-03-09 06:47:19,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:19,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:19,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:19,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:47:19,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:47:19,307 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:19,307 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 44819530, now seen corresponding path program 1 times [2025-03-09 06:47:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402061084] [2025-03-09 06:47:19,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:19,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:47:19,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:19,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:19,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:19,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402061084] [2025-03-09 06:47:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402061084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:19,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:47:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488565740] [2025-03-09 06:47:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:19,477 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:19,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1086342, now seen corresponding path program 1 times [2025-03-09 06:47:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238140745] [2025-03-09 06:47:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:19,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:19,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:19,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:19,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:19,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:47:19,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:47:19,585 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-03-09 06:47:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:19,603 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-03-09 06:47:19,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2025-03-09 06:47:19,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:47:19,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2025-03-09 06:47:19,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:47:19,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:47:19,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2025-03-09 06:47:19,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:19,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-09 06:47:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2025-03-09 06:47:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-09 06:47:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-09 06:47:19,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:47:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:19,606 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:47:19,606 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:47:19,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-03-09 06:47:19,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 06:47:19,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:19,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:19,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-03-09 06:47:19,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2025-03-09 06:47:19,607 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:19,607 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -516345915, now seen corresponding path program 1 times [2025-03-09 06:47:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584264609] [2025-03-09 06:47:19,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:19,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:19,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:19,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:19,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:19,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:19,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:19,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1996658935, now seen corresponding path program 1 times [2025-03-09 06:47:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869315781] [2025-03-09 06:47:19,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:19,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:47:19,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:47:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:19,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:47:19,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:47:19,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:19,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 1 times [2025-03-09 06:47:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:19,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844266065] [2025-03-09 06:47:19,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:19,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:19,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:19,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:19,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:19,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:19,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:20,905 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:20,906 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:20,906 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:20,906 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:20,906 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:20,906 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:20,906 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:20,906 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:20,906 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2025-03-09 06:47:20,906 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:20,906 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:20,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:20,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:20,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:20,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:21,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:21,599 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:21,599 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:21,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,602 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:47:21,603 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-03-09 06:47:21,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:21,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:21,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:21,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:21,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:21,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:21,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:21,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:21,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:47:21,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,622 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:47:21,624 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-03-09 06:47:21,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:21,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:21,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:21,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:21,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:21,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:21,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:21,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:21,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:47:21,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,643 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:47:21,644 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-03-09 06:47:21,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:21,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:21,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:21,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:21,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:21,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:21,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:21,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:21,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 06:47:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,663 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:47:21,664 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-03-09 06:47:21,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:21,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:21,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:21,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:21,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:21,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:21,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:21,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:47:21,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,686 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:47:21,688 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-03-09 06:47:21,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:21,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:21,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:21,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:21,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:21,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:21,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:21,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 06:47:21,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,710 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:47:21,712 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-03-09 06:47:21,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:21,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:21,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:21,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:21,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:21,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:21,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:21,746 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-09 06:47:21,746 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-09 06:47:21,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,748 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 06:47:21,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:21,763 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:47:21,763 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:21,763 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem6#1) = -2*ULTIMATE.start_main_#t~mem6#1 + 1 Supporting invariants [] [2025-03-09 06:47:21,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 06:47:21,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:21,871 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2025-03-09 06:47:21,872 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2025-03-09 06:47:21,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:21,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:21,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:21,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:21,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:21,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:21,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:21,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:47:21,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:47:21,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:21,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:21,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:47:21,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:21,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:47:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:47:21,952 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-03-09 06:47:21,952 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:21,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 5 states. [2025-03-09 06:47:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:47:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-09 06:47:21,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2025-03-09 06:47:21,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:21,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2025-03-09 06:47:21,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:21,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2025-03-09 06:47:21,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:21,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2025-03-09 06:47:21,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:47:21,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2025-03-09 06:47:21,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-09 06:47:21,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-09 06:47:21,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2025-03-09 06:47:21,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:21,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-09 06:47:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2025-03-09 06:47:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-09 06:47:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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-03-09 06:47:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-03-09 06:47:21,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-09 06:47:21,967 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-09 06:47:21,967 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:47:21,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2025-03-09 06:47:21,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:47:21,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:21,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:21,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:47:21,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:21,968 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:21,968 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-03-09 06:47:21,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145824, now seen corresponding path program 2 times [2025-03-09 06:47:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:21,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366144359] [2025-03-09 06:47:21,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:21,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:21,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 06:47:21,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:21,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:21,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:21,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:21,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:22,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:22,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:22,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 2 times [2025-03-09 06:47:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:22,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093418575] [2025-03-09 06:47:22,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:22,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:22,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:22,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:47:22,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:22,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:22,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:22,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:22,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:22,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:22,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:22,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1038369093, now seen corresponding path program 3 times [2025-03-09 06:47:22,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:22,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193692449] [2025-03-09 06:47:22,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:22,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 3 equivalence classes. [2025-03-09 06:47:22,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:47:22,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:47:22,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:22,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:22,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:47:22,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:47:22,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:22,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:22,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:23,260 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:23,261 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:23,261 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:23,261 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:23,261 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:23,261 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,261 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:23,261 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:23,261 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2025-03-09 06:47:23,261 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:23,261 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:23,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,797 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:23,797 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:23,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,800 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 06:47:23,801 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-03-09 06:47:23,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:47:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,819 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:47:23,821 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-03-09 06:47:23,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:47:23,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,840 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:47:23,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:23,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 06:47:23,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,859 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 06:47:23,860 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-03-09 06:47:23,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 06:47:23,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,878 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 06:47:23,880 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-03-09 06:47:23,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:47:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 06:47:23,900 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-03-09 06:47:23,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:23,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:23,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 06:47:23,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,920 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 06:47:23,921 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-03-09 06:47:23,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:23,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:23,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:23,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,941 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 06:47:23,943 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-03-09 06:47:23,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:23,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:23,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,970 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 06:47:23,972 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-03-09 06:47:23,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:23,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:23,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 06:47:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,993 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 06:47:23,995 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-03-09 06:47:24,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:24,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:24,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:24,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:24,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:24,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:24,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:24,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 06:47:24,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:24,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:24,017 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:24,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 06:47:24,018 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-03-09 06:47:24,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:24,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:24,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:24,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:24,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:24,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:24,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:24,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:47:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:24,041 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:24,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 06:47:24,043 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-03-09 06:47:24,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:24,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:24,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:24,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:24,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:24,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:24,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:24,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 06:47:24,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:24,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:24,068 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:24,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 06:47:24,069 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-03-09 06:47:24,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:24,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:24,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:24,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:24,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:24,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:24,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:24,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:47:24,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:24,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:24,089 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:24,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 06:47:24,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:24,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:24,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:24,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:24,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:24,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:24,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:24,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:24,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:47:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:24,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:24,111 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:24,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 06:47:24,112 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-03-09 06:47:24,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:24,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:24,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:24,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:24,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:24,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:24,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:24,131 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:47:24,131 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:47:24,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:24,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:24,133 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:24,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 06:47:24,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:24,148 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:47:24,149 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:24,149 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3 + 1 Supporting invariants [] [2025-03-09 06:47:24,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 06:47:24,214 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2025-03-09 06:47:24,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:47:24,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:47:24,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-03-09 06:47:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:24,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:24,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:24,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:24,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:24,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:24,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:24,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:24,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:24,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:24,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:24,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:47:24,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:24,300 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-03-09 06:47:24,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:24,315 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 76 transitions. Complement of second has 7 states. [2025-03-09 06:47:24,316 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-03-09 06:47:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-09 06:47:24,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-09 06:47:24,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:24,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-09 06:47:24,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:24,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2025-03-09 06:47:24,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:24,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2025-03-09 06:47:24,318 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-03-09 06:47:24,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2025-03-09 06:47:24,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-09 06:47:24,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-09 06:47:24,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2025-03-09 06:47:24,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:24,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-03-09 06:47:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2025-03-09 06:47:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-09 06:47:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 46 states have internal predecessors, (60), 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-03-09 06:47:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2025-03-09 06:47:24,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-03-09 06:47:24,321 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-03-09 06:47:24,321 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:47:24,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2025-03-09 06:47:24,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-03-09 06:47:24,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:24,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:24,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:47:24,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-03-09 06:47:24,322 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-03-09 06:47:24,322 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-03-09 06:47:24,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145827, now seen corresponding path program 1 times [2025-03-09 06:47:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:24,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037622613] [2025-03-09 06:47:24,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:24,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 06:47:24,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:24,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:47:24,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037622613] [2025-03-09 06:47:24,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037622613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:24,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:47:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360432963] [2025-03-09 06:47:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:24,390 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:24,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -24074498, now seen corresponding path program 1 times [2025-03-09 06:47:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:24,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143762220] [2025-03-09 06:47:24,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:24,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:24,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:24,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:24,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:24,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:24,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:24,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:24,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:24,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:24,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:47:24,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:47:24,613 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-03-09 06:47:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:24,624 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-09 06:47:24,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2025-03-09 06:47:24,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-09 06:47:24,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2025-03-09 06:47:24,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-09 06:47:24,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 06:47:24,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2025-03-09 06:47:24,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:24,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-09 06:47:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2025-03-09 06:47:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-09 06:47:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 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-03-09 06:47:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-09 06:47:24,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-09 06:47:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:24,628 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-09 06:47:24,628 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:47:24,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2025-03-09 06:47:24,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-09 06:47:24,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:24,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:24,629 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2025-03-09 06:47:24,629 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:24,629 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:24,629 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-03-09 06:47:24,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1135519200, now seen corresponding path program 4 times [2025-03-09 06:47:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307153037] [2025-03-09 06:47:24,630 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:47:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:24,636 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:47:24,640 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:47:24,640 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:47:24,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:47:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307153037] [2025-03-09 06:47:24,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307153037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:47:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672038269] [2025-03-09 06:47:24,780 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:47:24,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:47:24,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:24,782 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:47:24,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-09 06:47:24,820 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:47:24,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:47:24,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:47:24,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:24,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:47:24,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:24,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:47:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:47:24,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:47:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672038269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:47:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-09 06:47:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867321685] [2025-03-09 06:47:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:24,864 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 3 times [2025-03-09 06:47:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264127986] [2025-03-09 06:47:24,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:24,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:24,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:24,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:47:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:24,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:24,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:24,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:24,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:24,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:24,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:24,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:47:24,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:47:24,920 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-03-09 06:47:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:24,938 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-09 06:47:24,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-03-09 06:47:24,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-09 06:47:24,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2025-03-09 06:47:24,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-09 06:47:24,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 06:47:24,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2025-03-09 06:47:24,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:24,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-09 06:47:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2025-03-09 06:47:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-09 06:47:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-03-09 06:47:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-09 06:47:24,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-09 06:47:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:24,943 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-09 06:47:24,943 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:47:24,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2025-03-09 06:47:24,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-09 06:47:24,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:24,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:24,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2025-03-09 06:47:24,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-03-09 06:47:24,944 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:24,944 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-03-09 06:47:24,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 5 times [2025-03-09 06:47:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:24,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586855516] [2025-03-09 06:47:24,945 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:47:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:24,957 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 4 equivalence classes. [2025-03-09 06:47:24,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:24,982 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 06:47:24,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:24,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:24,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:24,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:24,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:24,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:24,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:24,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1776752198, now seen corresponding path program 1 times [2025-03-09 06:47:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:24,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985021419] [2025-03-09 06:47:24,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:25,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:25,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:25,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:25,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:25,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:25,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:25,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:25,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:25,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:25,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 229835522, now seen corresponding path program 1 times [2025-03-09 06:47:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:25,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339894104] [2025-03-09 06:47:25,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:25,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:47:25,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:47:25,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:25,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:25,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:25,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:47:25,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:47:25,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:25,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:25,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:26,660 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:26,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:26,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:26,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:26,660 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:26,660 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:26,660 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:26,660 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:26,660 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2025-03-09 06:47:26,660 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:26,661 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:26,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:26,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:26,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:26,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:27,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:27,395 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:27,395 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:27,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:27,398 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:27,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 06:47:27,399 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-03-09 06:47:27,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:27,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:27,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:27,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:27,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:27,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:27,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:27,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:27,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 06:47:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:27,419 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:27,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 06:47:27,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:27,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:27,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:27,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:27,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:27,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:27,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:27,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:27,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:27,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 06:47:27,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:27,439 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:27,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 06:47:27,441 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-03-09 06:47:27,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:27,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:27,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:27,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:27,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:27,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:27,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:27,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:27,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 06:47:27,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:27,460 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:27,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 06:47:27,462 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-03-09 06:47:27,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:27,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:27,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:27,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:27,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:27,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:27,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:27,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 06:47:27,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:27,485 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:27,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 06:47:27,487 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-03-09 06:47:27,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:27,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:27,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:27,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:27,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:27,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:27,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:27,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:27,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:27,516 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:27,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 06:47:27,517 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-03-09 06:47:27,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:27,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:27,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:27,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:27,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:27,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:47:27,543 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:27,547 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:47:27,547 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-09 06:47:27,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:27,549 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:27,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 06:47:27,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:27,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:47:27,562 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:27,562 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2025-03-09 06:47:27,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:27,656 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2025-03-09 06:47:27,658 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-09 06:47:27,658 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-09 06:47:27,658 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2025-03-09 06:47:27,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:27,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:27,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:27,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:27,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:27,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:27,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:27,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:27,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:47:27,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:27,734 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 30 treesize of output 18 [2025-03-09 06:47:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 06:47:27,769 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-03-09 06:47:27,770 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:27,784 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 77 transitions. Complement of second has 7 states. [2025-03-09 06:47:27,787 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-03-09 06:47:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-09 06:47:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2025-03-09 06:47:27,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2025-03-09 06:47:27,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2025-03-09 06:47:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:27,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2025-03-09 06:47:27,789 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-09 06:47:27,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2025-03-09 06:47:27,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-09 06:47:27,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-09 06:47:27,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2025-03-09 06:47:27,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:27,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-09 06:47:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2025-03-09 06:47:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 06:47:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 64 states have internal predecessors, (77), 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-03-09 06:47:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-03-09 06:47:27,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-09 06:47:27,796 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-09 06:47:27,796 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:47:27,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2025-03-09 06:47:27,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-09 06:47:27,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:27,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:27,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:47:27,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-03-09 06:47:27,797 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-09 06:47:27,797 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-03-09 06:47:27,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 841356932, now seen corresponding path program 1 times [2025-03-09 06:47:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960821188] [2025-03-09 06:47:27,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:27,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:47:27,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:47:27,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 06:47:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960821188] [2025-03-09 06:47:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960821188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:27,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:47:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400196733] [2025-03-09 06:47:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:27,875 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:27,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash -624921022, now seen corresponding path program 2 times [2025-03-09 06:47:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:27,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826828108] [2025-03-09 06:47:27,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:27,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 06:47:27,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:27,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:27,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:27,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:47:27,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:47:27,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:28,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:28,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:47:28,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:47:28,237 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:28,248 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-03-09 06:47:28,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2025-03-09 06:47:28,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-03-09 06:47:28,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2025-03-09 06:47:28,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-09 06:47:28,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-09 06:47:28,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2025-03-09 06:47:28,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:28,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-03-09 06:47:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2025-03-09 06:47:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-09 06:47:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 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-03-09 06:47:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2025-03-09 06:47:28,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-03-09 06:47:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:28,253 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-03-09 06:47:28,253 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:47:28,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2025-03-09 06:47:28,254 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-03-09 06:47:28,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:28,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:28,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 06:47:28,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:28,254 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-03-09 06:47:28,254 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-03-09 06:47:28,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash -564794174, now seen corresponding path program 2 times [2025-03-09 06:47:28,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358439756] [2025-03-09 06:47:28,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:28,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 06:47:28,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:47:28,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:28,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,278 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:28,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:47:28,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:47:28,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:28,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 4 times [2025-03-09 06:47:28,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550539963] [2025-03-09 06:47:28,292 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:47:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,294 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-09 06:47:28,295 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:28,295 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:47:28,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:28,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:28,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:28,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1898641955, now seen corresponding path program 3 times [2025-03-09 06:47:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968706815] [2025-03-09 06:47:28,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-03-09 06:47:28,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 23 statements. [2025-03-09 06:47:28,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:47:28,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 06:47:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:28,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968706815] [2025-03-09 06:47:28,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968706815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:28,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:28,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:47:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808607673] [2025-03-09 06:47:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:28,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:47:28,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:47:28,402 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 18 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-03-09 06:47:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:28,417 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-03-09 06:47:28,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2025-03-09 06:47:28,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-03-09 06:47:28,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2025-03-09 06:47:28,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-09 06:47:28,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-09 06:47:28,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2025-03-09 06:47:28,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:28,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-09 06:47:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2025-03-09 06:47:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-09 06:47:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 67 states have internal predecessors, (70), 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-03-09 06:47:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-03-09 06:47:28,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-03-09 06:47:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:28,421 INFO L432 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-03-09 06:47:28,421 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:47:28,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2025-03-09 06:47:28,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-03-09 06:47:28,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:28,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:28,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2025-03-09 06:47:28,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2025-03-09 06:47:28,423 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-09 06:47:28,423 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#1(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-09 06:47:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1828604801, now seen corresponding path program 1 times [2025-03-09 06:47:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806169303] [2025-03-09 06:47:28,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:47:28,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:47:28,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:28,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:47:28,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:47:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:28,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1437690398, now seen corresponding path program 1 times [2025-03-09 06:47:28,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067445599] [2025-03-09 06:47:28,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:47:28,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:47:28,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:28,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:47:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:47:28,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:28,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1843118434, now seen corresponding path program 2 times [2025-03-09 06:47:28,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549068562] [2025-03-09 06:47:28,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-09 06:47:28,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:47:28,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:28,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-09 06:47:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549068562] [2025-03-09 06:47:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549068562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:47:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695662718] [2025-03-09 06:47:28,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:28,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:47:28,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,694 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:47:28,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-09 06:47:28,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-09 06:47:28,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:47:28,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:28,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:28,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:47:28,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:28,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:47:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-09 06:47:28,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:47:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-09 06:47:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695662718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:47:28,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:47:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-09 06:47:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822282680] [2025-03-09 06:47:28,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:47:30,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:30,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:47:30,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:47:30,745 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:30,762 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2025-03-09 06:47:30,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2025-03-09 06:47:30,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:47:30,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2025-03-09 06:47:30,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:47:30,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:47:30,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:47:30,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:47:30,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:30,763 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,763 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:47:30,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:47:30,763 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:47:30,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:47:30,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:47:30 BoogieIcfgContainer [2025-03-09 06:47:30,769 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:47:30,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:47:30,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:47:30,769 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:47:30,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:16" (3/4) ... [2025-03-09 06:47:30,771 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:47:30,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:47:30,772 INFO L158 Benchmark]: Toolchain (without parser) took 14400.15ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 123.8MB in the beginning and 142.5MB in the end (delta: -18.7MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,772 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:30,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.39ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 113.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.24ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 112.5MB in the end (delta: 720.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:30,773 INFO L158 Benchmark]: Boogie Preprocessor took 17.97ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 110.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,773 INFO L158 Benchmark]: IcfgBuilder took 277.31ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 97.2MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,773 INFO L158 Benchmark]: BuchiAutomizer took 13948.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 97.2MB in the beginning and 142.5MB in the end (delta: -45.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,773 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 243.3MB. Free memory was 142.5MB in the beginning and 142.5MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:30,774 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.39ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 113.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.24ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 112.5MB in the end (delta: 720.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.97ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 110.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 277.31ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 97.2MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 13948.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 97.2MB in the beginning and 142.5MB in the end (delta: -45.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 243.3MB. Free memory was 142.5MB in the beginning and 142.5MB in the end (delta: 45.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~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[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 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 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.9s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/22 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 93 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital268 mio100 ax100 hnf100 lsp99 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq164 hnf90 smp100 dnf101 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:47:30,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:30,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:31,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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