./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:29:56,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:29:56,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:29:56,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:29:56,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:29:56,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:29:56,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:29:56,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:29:56,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:29:56,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:29:56,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:29:56,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:29:56,666 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:29:56,666 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:29:56,666 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:29:56,666 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:29:56,666 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:29:56,666 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:29:56,666 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:29:56,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:29:56,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:29:56,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:29:56,668 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:29:56,668 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:29:56,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:29:56,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:29:56,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:29:56,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:29:56,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:29:56,669 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:29:56,669 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 [2025-01-10 07:29:56,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:29:56,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:29:56,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:29:56,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:29:56,917 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:29:56,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2025-01-10 07:29:58,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8114b7d5a/aeeadfd1bedf4175b7c01d57ba14decd/FLAGc3e151a41 [2025-01-10 07:29:58,453 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:29:58,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2025-01-10 07:29:58,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8114b7d5a/aeeadfd1bedf4175b7c01d57ba14decd/FLAGc3e151a41 [2025-01-10 07:29:58,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8114b7d5a/aeeadfd1bedf4175b7c01d57ba14decd [2025-01-10 07:29:58,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:29:58,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:29:58,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:29:58,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:29:58,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:29:58,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:29:58" (1/1) ... [2025-01-10 07:29:58,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242ba109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:58, skipping insertion in model container [2025-01-10 07:29:58,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:29:58" (1/1) ... [2025-01-10 07:29:58,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:29:58,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:29:58,979 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:29:59,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:29:59,033 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:29:59,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59 WrapperNode [2025-01-10 07:29:59,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:29:59,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:29:59,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:29:59,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:29:59,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,066 INFO L138 Inliner]: procedures = 122, calls = 55, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 199 [2025-01-10 07:29:59,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:29:59,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:29:59,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:29:59,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:29:59,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,104 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 10, 5]. [2025-01-10 07:29:59,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:29:59,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:29:59,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:29:59,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:29:59,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (1/1) ... [2025-01-10 07:29:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:29:59,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:29:59,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:29:59,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:29:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:29:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:29:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:29:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:29:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:29:59,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:29:59,262 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:29:59,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:29:59,566 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-01-10 07:29:59,566 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:29:59,576 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:29:59,577 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-10 07:29:59,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:29:59 BoogieIcfgContainer [2025-01-10 07:29:59,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:29:59,578 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:29:59,578 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:29:59,582 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:29:59,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:29:59,583 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:29:58" (1/3) ... [2025-01-10 07:29:59,584 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fd7168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:29:59, skipping insertion in model container [2025-01-10 07:29:59,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:29:59,585 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:29:59" (2/3) ... [2025-01-10 07:29:59,585 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fd7168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:29:59, skipping insertion in model container [2025-01-10 07:29:59,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:29:59,585 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:29:59" (3/3) ... [2025-01-10 07:29:59,586 INFO L363 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2025-01-10 07:29:59,621 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:29:59,621 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:29:59,621 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:29:59,621 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:29:59,621 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:29:59,622 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:29:59,622 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:29:59,622 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:29:59,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 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-01-10 07:29:59,639 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 42 [2025-01-10 07:29:59,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:29:59,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:29:59,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:29:59,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:29:59,644 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:29:59,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 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-01-10 07:29:59,647 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 42 [2025-01-10 07:29:59,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:29:59,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:29:59,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:29:59,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:29:59,653 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-01-10 07:29:59,654 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;" "main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "assume !true;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;" [2025-01-10 07:29:59,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:29:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:29:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:29:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076437954] [2025-01-10 07:29:59,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:29:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:29:59,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:29:59,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:29:59,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:29:59,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:29:59,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:29:59,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:29:59,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:29:59,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:29:59,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:29:59,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:29:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:29:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -329764052, now seen corresponding path program 1 times [2025-01-10 07:29:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:29:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422146760] [2025-01-10 07:29:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:29:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:29:59,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:29:59,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:29:59,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:29:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:29:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:29:59,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:29:59,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422146760] [2025-01-10 07:29:59,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422146760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:29:59,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:29:59,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:29:59,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566184504] [2025-01-10 07:29:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:29:59,865 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:29:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:29:59,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 07:29:59,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 07:29:59,888 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-01-10 07:29:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:29:59,895 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2025-01-10 07:29:59,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2025-01-10 07:29:59,898 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 42 [2025-01-10 07:29:59,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 48 states and 68 transitions. [2025-01-10 07:29:59,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-01-10 07:29:59,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-01-10 07:29:59,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 68 transitions. [2025-01-10 07:29:59,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:29:59,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-01-10 07:29:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 68 transitions. [2025-01-10 07:29:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 07:29:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:29:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-01-10 07:29:59,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-01-10 07:29:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 07:29:59,948 INFO L432 stractBuchiCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-01-10 07:29:59,949 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:29:59,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 68 transitions. [2025-01-10 07:29:59,950 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 42 [2025-01-10 07:29:59,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:29:59,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:29:59,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:29:59,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:29:59,951 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-01-10 07:29:59,951 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;" "main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0;" "assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0;" "assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;" [2025-01-10 07:29:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:29:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 07:29:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:29:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760896244] [2025-01-10 07:29:59,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:29:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:29:59,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:29:59,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:29:59,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:29:59,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:29:59,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:29:59,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:29:59,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:29:59,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:29:59,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:29:59,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:29:59,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:29:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash -965072545, now seen corresponding path program 1 times [2025-01-10 07:29:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:29:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308489575] [2025-01-10 07:29:59,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:29:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:00,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:30:00,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:30:00,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:00,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:30:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:30:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:30:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308489575] [2025-01-10 07:30:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308489575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:30:00,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:30:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:30:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183904866] [2025-01-10 07:30:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:30:00,261 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:30:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:30:00,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:30:00,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:30:00,262 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:30:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:30:00,398 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2025-01-10 07:30:00,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 114 transitions. [2025-01-10 07:30:00,400 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 72 [2025-01-10 07:30:00,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 114 transitions. [2025-01-10 07:30:00,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-01-10 07:30:00,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2025-01-10 07:30:00,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 114 transitions. [2025-01-10 07:30:00,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:30:00,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-01-10 07:30:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 114 transitions. [2025-01-10 07:30:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 52. [2025-01-10 07:30:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 51 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:30:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2025-01-10 07:30:00,407 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 73 transitions. [2025-01-10 07:30:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:30:00,408 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 73 transitions. [2025-01-10 07:30:00,408 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:30:00,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 73 transitions. [2025-01-10 07:30:00,409 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 46 [2025-01-10 07:30:00,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:30:00,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:30:00,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:30:00,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:30:00,410 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-01-10 07:30:00,410 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;" "main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0;" "assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0;" "assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume !main_#t~short13#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;" [2025-01-10 07:30:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2025-01-10 07:30:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:00,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662774354] [2025-01-10 07:30:00,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:30:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:00,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:00,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:00,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:30:00,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:00,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:00,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:00,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:00,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:00,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:00,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash -963165921, now seen corresponding path program 1 times [2025-01-10 07:30:00,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:00,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885136110] [2025-01-10 07:30:00,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:00,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:00,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:30:00,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:30:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:00,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:00,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:30:00,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:30:00,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:00,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:00,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:00,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 250982881, now seen corresponding path program 1 times [2025-01-10 07:30:00,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:00,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690647747] [2025-01-10 07:30:00,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:00,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:00,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:30:00,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:30:00,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:00,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:30:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:30:00,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:30:00,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690647747] [2025-01-10 07:30:00,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690647747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:30:00,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:30:00,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:30:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862931171] [2025-01-10 07:30:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:30:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:30:00,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:30:00,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:30:00,890 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. cyclomatic complexity: 30 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:30:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:30:01,065 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2025-01-10 07:30:01,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 154 transitions. [2025-01-10 07:30:01,066 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 94 [2025-01-10 07:30:01,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 110 states and 154 transitions. [2025-01-10 07:30:01,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2025-01-10 07:30:01,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2025-01-10 07:30:01,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 154 transitions. [2025-01-10 07:30:01,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:30:01,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 154 transitions. [2025-01-10 07:30:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 154 transitions. [2025-01-10 07:30:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 65. [2025-01-10 07:30:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:30:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-01-10 07:30:01,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-01-10 07:30:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:30:01,071 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-01-10 07:30:01,072 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:30:01,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 90 transitions. [2025-01-10 07:30:01,072 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 59 [2025-01-10 07:30:01,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:30:01,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:30:01,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:30:01,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:30:01,073 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-01-10 07:30:01,073 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;" "main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0;" "assume !main_#t~short7#1;" "assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;" [2025-01-10 07:30:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:01,074 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2025-01-10 07:30:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:01,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456053420] [2025-01-10 07:30:01,074 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:30:01,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:01,079 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-01-10 07:30:01,082 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:01,082 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:30:01,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:01,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:01,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:01,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:01,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:01,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1774359589, now seen corresponding path program 1 times [2025-01-10 07:30:01,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:01,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088236712] [2025-01-10 07:30:01,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:01,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:30:01,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:30:01,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:01,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:01,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:30:01,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:30:01,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:01,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:01,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:30:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash -560210787, now seen corresponding path program 1 times [2025-01-10 07:30:01,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:30:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823410064] [2025-01-10 07:30:01,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:30:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:30:01,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:30:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:30:01,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:01,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:01,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:30:01,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:30:01,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:01,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:30:01,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:01,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:30:01,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:30:01,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:30:01,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:30:01,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:30:01,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:30:01 BoogieIcfgContainer [2025-01-10 07:30:01,700 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:30:01,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:30:01,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:30:01,701 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:30:01,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:29:59" (3/4) ... [2025-01-10 07:30:01,704 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:30:01,731 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:30:01,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:30:01,732 INFO L158 Benchmark]: Toolchain (without parser) took 3017.56ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 56.5MB in the end (delta: 54.9MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-01-10 07:30:01,732 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:30:01,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.12ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 93.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:30:01,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.92ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:30:01,733 INFO L158 Benchmark]: Boogie Preprocessor took 59.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:30:01,733 INFO L158 Benchmark]: RCFGBuilder took 451.11ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 62.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 07:30:01,734 INFO L158 Benchmark]: BuchiAutomizer took 2122.51ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 59.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:30:01,734 INFO L158 Benchmark]: Witness Printer took 30.69ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 56.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:30:01,735 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.56ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.12ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 93.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.92ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 451.11ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 62.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 2122.51ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 59.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 30.69ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 56.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 65 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 76 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 641 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 257 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] !n->left && __VERIFIER_nondet_int() [L563] !n->left && __VERIFIER_nondet_int() [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] !n->right && __VERIFIER_nondet_int() [L568] !n->right && __VERIFIER_nondet_int() [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] !n->left && __VERIFIER_nondet_int() [L563] !n->left && __VERIFIER_nondet_int() [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] !n->right && __VERIFIER_nondet_int() [L568] !n->right && __VERIFIER_nondet_int() [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:30:01,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)