./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 3061b6dc 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:41:35,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:41:35,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:41:35,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:41:35,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:41:35,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:41:35,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:41:35,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:41:35,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:41:35,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:41:35,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:41:35,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:41:35,729 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:41:35,730 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:41:35,731 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:41:35,731 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:41:35,731 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:41:35,731 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:41:35,732 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:41:35,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:41:35,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:41:35,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:41:35,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:41:35,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:41:35,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:41:35,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:41:35,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:41:35,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:41:35,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:41:35,736 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:41:35,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:41:35,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:41:35,737 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:41:35,737 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:41:35,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:41:35,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:41:35,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:41:35,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:41:35,739 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:41:35,739 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-19 14:41:35,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:41:36,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:41:36,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:41:36,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:41:36,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:41:36,010 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-19 14:41:37,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:41:37,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:41:37,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2024-11-19 14:41:37,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167e7f1e2/2412f8031bc8462ba7ab289fa64a75a7/FLAG13c26efb6 [2024-11-19 14:41:37,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167e7f1e2/2412f8031bc8462ba7ab289fa64a75a7 [2024-11-19 14:41:37,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:41:37,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:41:37,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:41:37,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:41:37,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:41:37,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:41:37" (1/1) ... [2024-11-19 14:41:37,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef7cbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:37, skipping insertion in model container [2024-11-19 14:41:37,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:41:37" (1/1) ... [2024-11-19 14:41:37,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:41:38,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:41:38,095 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:41:38,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:41:38,165 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:41:38,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38 WrapperNode [2024-11-19 14:41:38,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:41:38,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:41:38,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:41:38,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:41:38,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,228 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2024-11-19 14:41:38,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:41:38,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:41:38,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:41:38,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:41:38,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,266 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-19 14:41:38,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:41:38,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:41:38,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:41:38,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:41:38,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (1/1) ... [2024-11-19 14:41:38,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:41:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:41:38,337 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-19 14:41:38,340 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-19 14:41:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 14:41:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:41:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 14:41:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 14:41:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 14:41:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 14:41:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:41:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:41:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 14:41:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:41:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:41:38,536 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:41:38,538 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:41:38,901 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-19 14:41:38,901 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:41:38,913 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:41:38,916 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 14:41:38,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:38 BoogieIcfgContainer [2024-11-19 14:41:38,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:41:38,917 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:41:38,917 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:41:38,921 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:41:38,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:38,922 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:41:37" (1/3) ... [2024-11-19 14:41:38,924 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43909f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:41:38, skipping insertion in model container [2024-11-19 14:41:38,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:38,924 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:38" (2/3) ... [2024-11-19 14:41:38,925 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43909f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:41:38, skipping insertion in model container [2024-11-19 14:41:38,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:38,925 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:38" (3/3) ... [2024-11-19 14:41:38,927 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2024-11-19 14:41:38,977 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:41:38,977 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:41:38,977 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:41:38,977 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:41:38,977 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:41:38,978 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:41:38,978 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:41:38,978 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:41:38,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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-19 14:41:38,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:41:38,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:38,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:39,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:39,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:39,004 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:41:39,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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-19 14:41:39,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:41:39,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:39,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:39,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:39,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:39,013 INFO L745 eck$LassoCheckResult]: Stem: 20#$Ultimate##0true 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); 9#L-1true 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); 5#L552-4true [2024-11-19 14:41:39,013 INFO L747 eck$LassoCheckResult]: Loop: 5#L552-4true havoc main_#t~nondet4#1; 16#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; 24#L541-2true assume !true; 7#L540-5true 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; 6#L546true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 18#L546-2true 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; 12#L546-4true 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; 13#L552true assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 15#L552-2true 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; 5#L552-4true [2024-11-19 14:41:39,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:41:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544382660] [2024-11-19 14:41:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:39,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2024-11-19 14:41:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247379342] [2024-11-19 14:41:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:39,304 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-19 14:41:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247379342] [2024-11-19 14:41:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247379342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:41:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27054575] [2024-11-19 14:41:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:39,336 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:41:39,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:41:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:41:39,395 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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-19 14:41:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:39,404 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2024-11-19 14:41:39,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2024-11-19 14:41:39,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:41:39,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 30 transitions. [2024-11-19 14:41:39,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-19 14:41:39,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-19 14:41:39,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2024-11-19 14:41:39,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:39,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-11-19 14:41:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2024-11-19 14:41:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 14:41:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 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-19 14:41:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2024-11-19 14:41:39,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-11-19 14:41:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:41:39,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2024-11-19 14:41:39,446 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:41:39,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2024-11-19 14:41:39,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-19 14:41:39,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:39,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:39,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:39,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:39,449 INFO L745 eck$LassoCheckResult]: Stem: 73#$Ultimate##0 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); 66#L-1 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); 60#L552-4 [2024-11-19 14:41:39,450 INFO L747 eck$LassoCheckResult]: Loop: 60#L552-4 havoc main_#t~nondet4#1; 61#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#L541-2 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; 58#L540-1 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; 59#L540-3 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; 64#L540-5 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; 62#L546 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 63#L546-2 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; 69#L546-4 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; 70#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 71#L552-2 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; 60#L552-4 [2024-11-19 14:41:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:41:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188102582] [2024-11-19 14:41:39,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:41:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:41:39,489 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:39,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:39,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:39,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2024-11-19 14:41:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445867398] [2024-11-19 14:41:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:39,833 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-19 14:41:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445867398] [2024-11-19 14:41:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445867398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:39,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:41:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332741237] [2024-11-19 14:41:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:39,835 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:41:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:39,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:41:39,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:41:39,836 INFO L87 Difference]: Start difference. First operand 20 states and 30 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-19 14:41:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:40,045 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2024-11-19 14:41:40,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2024-11-19 14:41:40,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2024-11-19 14:41:40,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2024-11-19 14:41:40,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-19 14:41:40,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-19 14:41:40,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2024-11-19 14:41:40,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:40,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2024-11-19 14:41:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2024-11-19 14:41:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2024-11-19 14:41:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:41:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2024-11-19 14:41:40,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-11-19 14:41:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:41:40,058 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-11-19 14:41:40,058 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:41:40,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2024-11-19 14:41:40,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2024-11-19 14:41:40,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:40,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:40,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:40,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:40,062 INFO L745 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 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); 129#L-1 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); 122#L552-4 [2024-11-19 14:41:40,062 INFO L747 eck$LassoCheckResult]: Loop: 122#L552-4 havoc main_#t~nondet4#1; 123#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#L541-2 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; 119#L540-1 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; 120#L540-3 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; 140#L540-5 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; 124#L546 assume !main_#t~short13#1; 125#L546-2 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; 132#L546-4 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; 133#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 134#L552-2 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; 122#L552-4 [2024-11-19 14:41:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:41:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:40,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378466049] [2024-11-19 14:41:40,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:41:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:40,079 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:41:40,083 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:40,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:40,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:40,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2024-11-19 14:41:40,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:40,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26845259] [2024-11-19 14:41:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:40,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:40,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:40,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:40,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:40,189 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2024-11-19 14:41:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:40,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688578549] [2024-11-19 14:41:40,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:40,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:40,569 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-19 14:41:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688578549] [2024-11-19 14:41:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688578549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:41:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914806754] [2024-11-19 14:41:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:57,720 WARN L286 SmtUtils]: Spent 9.71s 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-19 14:41:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:41:57,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:41:57,722 INFO L87 Difference]: Start difference. First operand 24 states and 35 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-19 14:41:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:57,906 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2024-11-19 14:41:57,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2024-11-19 14:41:57,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-11-19 14:41:57,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 56 transitions. [2024-11-19 14:41:57,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-19 14:41:57,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-19 14:41:57,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 56 transitions. [2024-11-19 14:41:57,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:57,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-19 14:41:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 56 transitions. [2024-11-19 14:41:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-19 14:41:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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-19 14:41:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-11-19 14:41:57,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-11-19 14:41:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:41:57,917 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-11-19 14:41:57,917 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:41:57,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2024-11-19 14:41:57,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-11-19 14:41:57,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:57,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:57,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:57,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:57,919 INFO L745 eck$LassoCheckResult]: Stem: 218#$Ultimate##0 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); 205#L-1 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); 199#L552-4 [2024-11-19 14:41:57,919 INFO L747 eck$LassoCheckResult]: Loop: 199#L552-4 havoc main_#t~nondet4#1; 200#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; 221#L541-2 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; 197#L540-1 assume !main_#t~short7#1; 198#L540-3 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; 207#L540-5 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; 229#L546 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 227#L546-2 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; 208#L546-4 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; 209#L552 assume main_#t~short20#1;havoc main_#t~nondet19#1;main_#t~short20#1 := 0 != main_#t~nondet19#1; 212#L552-2 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; 199#L552-4 [2024-11-19 14:41:57,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:57,919 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:41:57,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444803663] [2024-11-19 14:41:57,920 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:41:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:57,933 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:41:57,933 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:57,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:57,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:57,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2024-11-19 14:41:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169622823] [2024-11-19 14:41:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:57,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:57,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2024-11-19 14:41:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351579198] [2024-11-19 14:41:57,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:57,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:57,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:58,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:58,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:41:58 BoogieIcfgContainer [2024-11-19 14:41:58,573 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:41:58,573 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:41:58,573 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:41:58,574 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:41:58,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:38" (3/4) ... [2024-11-19 14:41:58,576 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:41:58,615 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:41:58,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:41:58,616 INFO L158 Benchmark]: Toolchain (without parser) took 20880.12ms. Allocated memory was 172.0MB in the beginning and 312.5MB in the end (delta: 140.5MB). Free memory was 103.5MB in the beginning and 135.0MB in the end (delta: -31.5MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2024-11-19 14:41:58,617 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 172.0MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:41:58,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.28ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 83.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 14:41:58,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.36ms. Allocated memory is still 172.0MB. Free memory was 83.3MB in the beginning and 141.1MB in the end (delta: -57.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-19 14:41:58,618 INFO L158 Benchmark]: Boogie Preprocessor took 67.99ms. Allocated memory is still 172.0MB. Free memory was 141.1MB in the beginning and 138.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:41:58,618 INFO L158 Benchmark]: RCFGBuilder took 618.01ms. Allocated memory is still 172.0MB. Free memory was 138.2MB in the beginning and 110.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 14:41:58,618 INFO L158 Benchmark]: BuchiAutomizer took 19655.51ms. Allocated memory was 172.0MB in the beginning and 312.5MB in the end (delta: 140.5MB). Free memory was 110.9MB in the beginning and 136.9MB in the end (delta: -26.0MB). Peak memory consumption was 114.0MB. Max. memory is 16.1GB. [2024-11-19 14:41:58,619 INFO L158 Benchmark]: Witness Printer took 42.55ms. Allocated memory is still 312.5MB. Free memory was 136.9MB in the beginning and 135.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:41:58,621 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.21ms. Allocated memory is still 172.0MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.28ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 83.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.36ms. Allocated memory is still 172.0MB. Free memory was 83.3MB in the beginning and 141.1MB in the end (delta: -57.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.99ms. Allocated memory is still 172.0MB. Free memory was 141.1MB in the beginning and 138.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 618.01ms. Allocated memory is still 172.0MB. Free memory was 138.2MB in the beginning and 110.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 19655.51ms. Allocated memory was 172.0MB in the beginning and 312.5MB in the end (delta: 140.5MB). Free memory was 110.9MB in the beginning and 136.9MB in the end (delta: -26.0MB). Peak memory consumption was 114.0MB. Max. memory is 16.1GB. * Witness Printer took 42.55ms. Allocated memory is still 312.5MB. Free memory was 136.9MB in the beginning and 135.0MB 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 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 19.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. 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, 173 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 81 mSDtfsCounter, 118 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-19 14:41:58,656 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)