./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 8fc3dc66 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/list-ext2-properties/list_and_tree_cnstr-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:17:18,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:17:18,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:17:18,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:17:18,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:17:18,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:17:18,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:17:18,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:17:18,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:17:18,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:17:18,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:17:18,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:17:18,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:17:18,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:17:18,409 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:17:18,410 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:17:18,410 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:17:18,410 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:17:18,410 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:17:18,410 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:17:18,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:17:18,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:17:18,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:17:18,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:17:18,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:17:18,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:17:18,412 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:17:18,412 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 [2025-03-17 20:17:18,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:17:18,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:17:18,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:17:18,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:17:18,645 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:17:18,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2025-03-17 20:17:19,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb64e8700/9a359428fbb2410bac6395814e9098d1/FLAG81163ec6a [2025-03-17 20:17:19,999 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:17:20,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2025-03-17 20:17:20,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb64e8700/9a359428fbb2410bac6395814e9098d1/FLAG81163ec6a [2025-03-17 20:17:20,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb64e8700/9a359428fbb2410bac6395814e9098d1 [2025-03-17 20:17:20,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:17:20,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:17:20,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:20,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:17:20,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:17:20,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e14d443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20, skipping insertion in model container [2025-03-17 20:17:20,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:17:20,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:20,621 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:17:20,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:20,679 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:17:20,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20 WrapperNode [2025-03-17 20:17:20,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:20,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:20,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:17:20,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:17:20,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,723 INFO L138 Inliner]: procedures = 122, calls = 55, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 199 [2025-03-17 20:17:20,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:20,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:17:20,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:17:20,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:17:20,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,751 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-03-17 20:17:20,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:17:20,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:17:20,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:17:20,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:17:20,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (1/1) ... [2025-03-17 20:17:20,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:20,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:20,794 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-17 20:17:20,796 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-17 20:17:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:17:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:17:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 20:17:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:17:20,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:17:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:17:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:17:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:17:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:17:20,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:17:20,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:17:20,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:17:21,210 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L609: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 20:17:21,210 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L602: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 20:17:21,210 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L596: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 20:17:21,230 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-17 20:17:21,231 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:17:21,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:17:21,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:17:21,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:21 BoogieIcfgContainer [2025-03-17 20:17:21,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:17:21,238 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:17:21,238 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:17:21,242 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:17:21,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:21,243 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:17:20" (1/3) ... [2025-03-17 20:17:21,244 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62ea3793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:21, skipping insertion in model container [2025-03-17 20:17:21,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:21,244 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:20" (2/3) ... [2025-03-17 20:17:21,244 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62ea3793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:21, skipping insertion in model container [2025-03-17 20:17:21,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:21,244 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:21" (3/3) ... [2025-03-17 20:17:21,245 INFO L363 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2025-03-17 20:17:21,283 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:17:21,283 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:17:21,283 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:17:21,283 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:17:21,283 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:17:21,283 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:17:21,284 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:17:21,284 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:17:21,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 46 states have internal predecessors, (76), 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-17 20:17:21,303 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:21,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:21,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:21,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:21,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:21,308 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:17:21,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 46 states have internal predecessors, (76), 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-17 20:17:21,310 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:21,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:21,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:21,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:21,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:21,314 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-03-17 20:17:21,314 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2025-03-17 20:17:21,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 1 times [2025-03-17 20:17:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530632616] [2025-03-17 20:17:21,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:21,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 325385743, now seen corresponding path program 1 times [2025-03-17 20:17:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864066358] [2025-03-17 20:17:21,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:17:21,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:17:21,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:21,520 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-17 20:17:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864066358] [2025-03-17 20:17:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864066358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:17:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114875670] [2025-03-17 20:17:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:21,525 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:17:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:21,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 20:17:21,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 20:17:21,548 INFO L87 Difference]: Start difference. First operand has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 46 states have internal predecessors, (76), 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 4.5) internal successors, (9), 2 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-17 20:17:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:21,559 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2025-03-17 20:17:21,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 66 transitions. [2025-03-17 20:17:21,563 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:21,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 40 states and 60 transitions. [2025-03-17 20:17:21,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-17 20:17:21,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:17:21,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 60 transitions. [2025-03-17 20:17:21,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:21,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-03-17 20:17:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 60 transitions. [2025-03-17 20:17:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 20:17:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 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-17 20:17:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2025-03-17 20:17:21,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-03-17 20:17:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 20:17:21,588 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-03-17 20:17:21,588 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:17:21,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 60 transitions. [2025-03-17 20:17:21,589 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2025-03-17 20:17:21,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:21,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:21,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:21,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:21,590 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-03-17 20:17:21,590 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2025-03-17 20:17:21,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 2 times [2025-03-17 20:17:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439690165] [2025-03-17 20:17:21,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:17:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:17:21,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:21,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:21,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1974714964, now seen corresponding path program 1 times [2025-03-17 20:17:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405294497] [2025-03-17 20:17:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:21,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:21,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:21,896 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-17 20:17:21,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:21,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405294497] [2025-03-17 20:17:21,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405294497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:21,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:21,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:17:21,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335651990] [2025-03-17 20:17:21,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:21,897 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:17:21,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:21,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:21,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:21,898 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 20:17:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:22,019 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2025-03-17 20:17:22,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,020 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 60 [2025-03-17 20:17:22,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 101 transitions. [2025-03-17 20:17:22,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-03-17 20:17:22,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-17 20:17:22,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:22,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 101 transitions. [2025-03-17 20:17:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2025-03-17 20:17:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 43 states have internal predecessors, (65), 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-17 20:17:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 20:17:22,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 20:17:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:17:22,034 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 20:17:22,034 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:17:22,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 65 transitions. [2025-03-17 20:17:22,034 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 39 [2025-03-17 20:17:22,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:22,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:22,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:22,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:22,035 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-03-17 20:17:22,035 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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;" "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;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2025-03-17 20:17:22,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 3 times [2025-03-17 20:17:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041879677] [2025-03-17 20:17:22,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:17:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:22,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:22,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:17:22,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:22,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:22,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:22,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:22,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash -230951317, now seen corresponding path program 1 times [2025-03-17 20:17:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438773541] [2025-03-17 20:17:22,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:22,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:22,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:22,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:22,183 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-17 20:17:22,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:22,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438773541] [2025-03-17 20:17:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438773541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:22,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:22,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:17:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227508060] [2025-03-17 20:17:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:22,184 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:17:22,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:22,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:22,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:22,184 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. cyclomatic complexity: 30 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 20:17:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:22,318 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2025-03-17 20:17:22,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,321 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 60 [2025-03-17 20:17:22,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 101 transitions. [2025-03-17 20:17:22,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-03-17 20:17:22,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-17 20:17:22,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:22,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 101 transitions. [2025-03-17 20:17:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 101 transitions. [2025-03-17 20:17:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2025-03-17 20:17:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 43 states have internal predecessors, (64), 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-17 20:17:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2025-03-17 20:17:22,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 20:17:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:17:22,328 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 20:17:22,329 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:17:22,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 64 transitions. [2025-03-17 20:17:22,329 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 39 [2025-03-17 20:17:22,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:22,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:22,331 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:22,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:22,331 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-03-17 20:17:22,331 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2025-03-17 20:17:22,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 4 times [2025-03-17 20:17:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513770423] [2025-03-17 20:17:22,332 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:17:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,338 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 20:17:22,344 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:22,344 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:17:22,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:22,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:22,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:22,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1973761652, now seen corresponding path program 1 times [2025-03-17 20:17:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637462386] [2025-03-17 20:17:22,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:22,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:22,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:22,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:22,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:22,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:22,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:22,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash 760345459, now seen corresponding path program 1 times [2025-03-17 20:17:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114862573] [2025-03-17 20:17:22,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:22,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:22,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:22,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:22,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:22,585 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-17 20:17:22,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:22,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114862573] [2025-03-17 20:17:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114862573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:17:22,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598056653] [2025-03-17 20:17:22,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:24,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:24,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:24,955 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 2.4) 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-17 20:17:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:25,106 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2025-03-17 20:17:25,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 135 transitions. [2025-03-17 20:17:25,106 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 79 [2025-03-17 20:17:25,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 135 transitions. [2025-03-17 20:17:25,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2025-03-17 20:17:25,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2025-03-17 20:17:25,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 135 transitions. [2025-03-17 20:17:25,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:25,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-17 20:17:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 135 transitions. [2025-03-17 20:17:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2025-03-17 20:17:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 54 states have internal predecessors, (78), 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-17 20:17:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-03-17 20:17:25,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-17 20:17:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:17:25,112 INFO L432 stractBuchiCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-17 20:17:25,112 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:17:25,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 78 transitions. [2025-03-17 20:17:25,113 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 50 [2025-03-17 20:17:25,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:25,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:25,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:25,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:25,113 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-03-17 20:17:25,113 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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~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-03-17 20:17:25,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 5 times [2025-03-17 20:17:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291860593] [2025-03-17 20:17:25,114 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:17:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,120 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,122 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:17:25,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,123 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash -231874837, now seen corresponding path program 1 times [2025-03-17 20:17:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495570856] [2025-03-17 20:17:25,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:25,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:25,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:17:25,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:17:25,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1792735022, now seen corresponding path program 1 times [2025-03-17 20:17:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51182357] [2025-03-17 20:17:25,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:25,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:25,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:25,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:25,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:17:25 BoogieIcfgContainer [2025-03-17 20:17:25,608 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:17:25,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:17:25,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:17:25,609 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:17:25,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:21" (3/4) ... [2025-03-17 20:17:25,611 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 20:17:25,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 20:17:25,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:17:25,634 INFO L158 Benchmark]: Toolchain (without parser) took 5267.83ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 94.0MB in the end (delta: 27.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,634 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 192.9MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:25,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.57ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 103.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.68ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 101.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:25,634 INFO L158 Benchmark]: Boogie Preprocessor took 39.14ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 98.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,635 INFO L158 Benchmark]: IcfgBuilder took 473.56ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 72.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 20:17:25,635 INFO L158 Benchmark]: BuchiAutomizer took 4369.93ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 96.5MB in the end (delta: -24.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:25,635 INFO L158 Benchmark]: Witness Printer took 24.89ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 94.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:25,636 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.23ms. Allocated memory is still 192.9MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.57ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 103.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.68ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 101.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.14ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 98.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 473.56ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 72.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 4369.93ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 96.5MB in the end (delta: -24.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 24.89ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 94.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 55 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 90 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 313 mSDtfsCounter, 211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 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() [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] COND TRUE n->left && n->right [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() [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] COND TRUE n->left && n->right [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-03-17 20:17:25,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)