./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/memsafety-ext/tree_parent_ptr.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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:29:29,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:29:29,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:29:29,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:29:29,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:29:29,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:29:29,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:29:29,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:29:29,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:29:29,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:29:29,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:29:29,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:29:29,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:29:29,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:29:29,437 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:29:29,437 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:29:29,438 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:29:29,438 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:29:29,438 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:29:29,439 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:29:29,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:29:29,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:29:29,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:29:29,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:29:29,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:29:29,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:29:29,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:29:29,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:29:29,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:29:29,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:29:29,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:29:29,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:29:29,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:29:29,443 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:29:29,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:29:29,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:29:29,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:29:29,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:29:29,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:29:29,447 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:29:29,447 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2024-11-17 08:29:29,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:29:29,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:29:29,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:29:29,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:29:29,723 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:29:29,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-17 08:29:31,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:29:31,362 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:29:31,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-17 08:29:31,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcb157c7/ebfcaa23b7134bd694546492195d9060/FLAGdfc031ae0 [2024-11-17 08:29:31,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcb157c7/ebfcaa23b7134bd694546492195d9060 [2024-11-17 08:29:31,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:29:31,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:29:31,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:29:31,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:29:31,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:29:31,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbbe4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31, skipping insertion in model container [2024-11-17 08:29:31,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:29:31,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:29:31,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:29:31,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:29:31,893 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:29:31,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31 WrapperNode [2024-11-17 08:29:31,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:29:31,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:29:31,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:29:31,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:29:31,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,940 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2024-11-17 08:29:31,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:29:31,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:29:31,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:29:31,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:29:31,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,979 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-11-17 08:29:31,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:31,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:29:31,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:29:31,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:29:31,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:29:31,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (1/1) ... [2024-11-17 08:29:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:32,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:32,035 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) [2024-11-17 08:29:32,039 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 [2024-11-17 08:29:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 08:29:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:29:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 08:29:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 08:29:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 08:29:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 08:29:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:29:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:29:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:29:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:29:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:29:32,229 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:29:32,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:29:32,603 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-17 08:29:32,603 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:29:32,617 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:29:32,617 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:29:32,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:32 BoogieIcfgContainer [2024-11-17 08:29:32,619 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:29:32,620 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:29:32,620 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:29:32,624 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:29:32,625 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:32,625 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:29:31" (1/3) ... [2024-11-17 08:29:32,626 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14c04468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:32, skipping insertion in model container [2024-11-17 08:29:32,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:32,626 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:31" (2/3) ... [2024-11-17 08:29:32,628 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14c04468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:32, skipping insertion in model container [2024-11-17 08:29:32,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:32,629 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:32" (3/3) ... [2024-11-17 08:29:32,630 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2024-11-17 08:29:32,687 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:29:32,687 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:29:32,688 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:29:32,688 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:29:32,688 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:29:32,688 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:29:32,688 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:29:32,688 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:29:32,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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) [2024-11-17 08:29:32,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:32,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:32,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:32,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:32,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:32,720 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:29:32,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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) [2024-11-17 08:29:32,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:32,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:32,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:32,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:32,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:32,732 INFO L745 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue 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(18, 2); 20#ULTIMATE.init_returnLabel#1true assume true;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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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~malloc25#1.base, main_#t~malloc25#1.offset, 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~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 9#L538true [2024-11-17 08:29:32,732 INFO L747 eck$LassoCheckResult]: Loop: 9#L538true assume true;havoc main_#t~nondet4#1; 19#L538-1true 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; 17#L540true assume !true; 12#L546-2true 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; 7#L546-1true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 5#L546true 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(12);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, main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem17#1.base, 8 + main_#t~mem17#1.offset, 4);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; 18#L552-2true call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 6#L552-1true assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 8#L552true assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#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, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#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~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 9#L538true [2024-11-17 08:29:32,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2336, now seen corresponding path program 1 times [2024-11-17 08:29:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134744990] [2024-11-17 08:29:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:32,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:32,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:32,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1505351262, now seen corresponding path program 1 times [2024-11-17 08:29:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:32,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255889038] [2024-11-17 08:29:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255889038] [2024-11-17 08:29:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255889038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:33,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:33,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:29:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911365306] [2024-11-17 08:29:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:33,115 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:29:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:29:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:29:33,142 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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) [2024-11-17 08:29:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:33,149 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2024-11-17 08:29:33,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2024-11-17 08:29:33,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:33,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 31 transitions. [2024-11-17 08:29:33,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:29:33,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:29:33,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2024-11-17 08:29:33,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:29:33,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-11-17 08:29:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2024-11-17 08:29:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 08:29:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 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) [2024-11-17 08:29:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2024-11-17 08:29:33,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-11-17 08:29:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:29:33,189 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2024-11-17 08:29:33,191 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:29:33,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2024-11-17 08:29:33,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:29:33,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:33,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:33,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:33,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:33,194 INFO L745 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY 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(18, 2); 64#ULTIMATE.init_returnLabel#1 assume true;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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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~malloc25#1.base, main_#t~malloc25#1.offset, 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~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 70#L538 [2024-11-17 08:29:33,195 INFO L747 eck$LassoCheckResult]: Loop: 70#L538 assume true;havoc main_#t~nondet4#1; 71#L538-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; 72#L540 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; 73#L540-2 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; 60#L540-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; 61#L546-2 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; 69#L546-1 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 65#L546 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(12);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, main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem17#1.base, 8 + main_#t~mem17#1.offset, 4);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; 66#L552-2 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 67#L552-1 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 68#L552 assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#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, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#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~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 70#L538 [2024-11-17 08:29:33,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2336, now seen corresponding path program 2 times [2024-11-17 08:29:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692724634] [2024-11-17 08:29:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1508244698, now seen corresponding path program 1 times [2024-11-17 08:29:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971635803] [2024-11-17 08:29:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:33,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:33,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971635803] [2024-11-17 08:29:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971635803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:33,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:33,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:29:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578284659] [2024-11-17 08:29:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:33,651 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:29:33,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:33,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:29:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:29:33,652 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 12 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) [2024-11-17 08:29:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:33,857 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2024-11-17 08:29:33,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 46 transitions. [2024-11-17 08:29:33,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2024-11-17 08:29:33,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 46 transitions. [2024-11-17 08:29:33,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-17 08:29:33,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-17 08:29:33,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 46 transitions. [2024-11-17 08:29:33,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:29:33,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 46 transitions. [2024-11-17 08:29:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 46 transitions. [2024-11-17 08:29:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-11-17 08:29:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-17 08:29:33,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-17 08:29:33,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:29:33,873 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-17 08:29:33,873 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:29:33,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-11-17 08:29:33,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2024-11-17 08:29:33,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:33,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:33,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:33,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:33,875 INFO L745 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY 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(18, 2); 127#ULTIMATE.init_returnLabel#1 assume true;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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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~malloc25#1.base, main_#t~malloc25#1.offset, 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~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 133#L538 [2024-11-17 08:29:33,875 INFO L747 eck$LassoCheckResult]: Loop: 133#L538 assume true;havoc main_#t~nondet4#1; 134#L538-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; 135#L540 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; 136#L540-2 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; 138#L540-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; 139#L546-2 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; 132#L546-1 assume !main_#t~short13#1; 128#L546 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; 129#L552-2 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 130#L552-1 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 131#L552 assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$#1(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc21#1.base, main_#t~malloc21#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, main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;call main_#t~mem23#1.base, main_#t~mem23#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~mem23#1.base, 4 + main_#t~mem23#1.offset, 4);havoc main_#t~mem23#1.base, main_#t~mem23#1.offset;call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem24#1.base, 8 + main_#t~mem24#1.offset, 4);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; 133#L538 [2024-11-17 08:29:33,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2336, now seen corresponding path program 3 times [2024-11-17 08:29:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:33,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347662719] [2024-11-17 08:29:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1509198010, now seen corresponding path program 1 times [2024-11-17 08:29:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831586896] [2024-11-17 08:29:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:33,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:34,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:34,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:34,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2025331141, now seen corresponding path program 1 times [2024-11-17 08:29:34,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:34,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157895411] [2024-11-17 08:29:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:34,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157895411] [2024-11-17 08:29:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157895411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:34,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:29:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385241956] [2024-11-17 08:29:34,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:51,128 WARN L286 SmtUtils]: Spent 9.17s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-17 08:29:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:29:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:29:51,131 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:51,311 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2024-11-17 08:29:51,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 57 transitions. [2024-11-17 08:29:51,312 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2024-11-17 08:29:51,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 57 transitions. [2024-11-17 08:29:51,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-17 08:29:51,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-17 08:29:51,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 57 transitions. [2024-11-17 08:29:51,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:29:51,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-11-17 08:29:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 57 transitions. [2024-11-17 08:29:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-17 08:29:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 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) [2024-11-17 08:29:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2024-11-17 08:29:51,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 52 transitions. [2024-11-17 08:29:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:29:51,319 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 52 transitions. [2024-11-17 08:29:51,319 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:29:51,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 52 transitions. [2024-11-17 08:29:51,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2024-11-17 08:29:51,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:51,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:51,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:51,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:51,322 INFO L745 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY 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(18, 2); 206#ULTIMATE.init_returnLabel#1 assume true;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~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#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~malloc25#1.base, main_#t~malloc25#1.offset, 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~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);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);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 216#L538 [2024-11-17 08:29:51,322 INFO L747 eck$LassoCheckResult]: Loop: 216#L538 assume true;havoc main_#t~nondet4#1; 217#L538-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; 218#L540 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; 219#L540-2 assume !main_#t~short7#1; 225#L540-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; 237#L546-2 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; 211#L546-1 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 212#L546 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; 234#L552-2 call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; 233#L552-1 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 214#L552 assume !main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1; 216#L538 [2024-11-17 08:29:51,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2336, now seen corresponding path program 4 times [2024-11-17 08:29:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173905638] [2024-11-17 08:29:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:51,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:51,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:51,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1043882471, now seen corresponding path program 1 times [2024-11-17 08:29:51,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:51,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391747640] [2024-11-17 08:29:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:51,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:51,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:51,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:51,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -283444326, now seen corresponding path program 1 times [2024-11-17 08:29:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525269051] [2024-11-17 08:29:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:51,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:51,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:51,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:52,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:29:52 BoogieIcfgContainer [2024-11-17 08:29:52,013 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:29:52,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:29:52,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:29:52,014 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:29:52,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:32" (3/4) ... [2024-11-17 08:29:52,017 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:29:52,045 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:29:52,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:29:52,046 INFO L158 Benchmark]: Toolchain (without parser) took 20649.74ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 106.8MB in the beginning and 110.7MB in the end (delta: -3.8MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-11-17 08:29:52,046 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:29:52,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.41ms. Allocated memory is still 172.0MB. Free memory was 106.4MB in the beginning and 130.8MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:29:52,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.34ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 127.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 08:29:52,048 INFO L158 Benchmark]: Boogie Preprocessor took 54.93ms. Allocated memory is still 172.0MB. Free memory was 127.9MB in the beginning and 125.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:29:52,048 INFO L158 Benchmark]: IcfgBuilder took 622.40ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 97.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-17 08:29:52,048 INFO L158 Benchmark]: BuchiAutomizer took 19393.20ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 97.9MB in the beginning and 112.6MB in the end (delta: -14.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-17 08:29:52,049 INFO L158 Benchmark]: Witness Printer took 31.83ms. Allocated memory is still 213.9MB. Free memory was 112.6MB in the beginning and 110.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:29:52,054 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.19ms. Allocated memory is still 96.5MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.41ms. Allocated memory is still 172.0MB. Free memory was 106.4MB in the beginning and 130.8MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.34ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 127.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.93ms. Allocated memory is still 172.0MB. Free memory was 127.9MB in the beginning and 125.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 622.40ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 97.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 19393.20ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 97.9MB in the beginning and 112.6MB in the end (delta: -14.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 31.83ms. Allocated memory is still 213.9MB. Free memory was 112.6MB in the beginning and 110.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 37 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 18.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 89 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] !n->left && __VERIFIER_nondet_int() [L546] !n->left && __VERIFIER_nondet_int() [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] !n->right && __VERIFIER_nondet_int() [L552] !n->right && __VERIFIER_nondet_int() [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] !n->left && __VERIFIER_nondet_int() [L546] !n->left && __VERIFIER_nondet_int() [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] !n->right && __VERIFIER_nondet_int() [L552] !n->right && __VERIFIER_nondet_int() [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-17 08:29:52,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)