./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.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/list-ext2-properties/list_and_tree_cnstr-1.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 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:41:23,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:41:23,574 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:23,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:41:23,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:41:23,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:41:23,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:41:23,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:41:23,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:41:23,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:41:23,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:41:23,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:41:23,596 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:41:23,597 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:41:23,597 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:41:23,597 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:41:23,598 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:41:23,598 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:41:23,598 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:41:23,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:41:23,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:41:23,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:41:23,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:41:23,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:41:23,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:41:23,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:41:23,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:41:23,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:41:23,602 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:41:23,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:41:23,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:41:23,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:41:23,603 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:41:23,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:41:23,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:41:23,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:41:23,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:41:23,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:41:23,605 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:41:23,606 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 -> 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a [2024-11-19 14:41:23,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:41:23,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:41:23,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:41:23,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:41:23,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:41:23,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-19 14:41:25,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:41:25,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:41:25,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-19 14:41:25,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bda8d6e/959c3ee5934946ea99c56b2828f3fb4c/FLAG9c07fca67 [2024-11-19 14:41:25,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6bda8d6e/959c3ee5934946ea99c56b2828f3fb4c [2024-11-19 14:41:25,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:41:25,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:41:25,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:41:25,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:41:25,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:41:25,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:41:25" (1/1) ... [2024-11-19 14:41:25,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc50bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:25, skipping insertion in model container [2024-11-19 14:41:25,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:41:25" (1/1) ... [2024-11-19 14:41:25,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:41:26,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:41:26,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:41:26,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:41:26,116 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:41:26,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:26 WrapperNode [2024-11-19 14:41:26,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:41:26,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:41:26,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:41:26,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:41:26,125 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:26" (1/1) ... [2024-11-19 14:41:26,138 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:26" (1/1) ... [2024-11-19 14:41:26,167 INFO L138 Inliner]: procedures = 122, calls = 55, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 209 [2024-11-19 14:41:26,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:41:26,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:41:26,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:41:26,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:41:26,179 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:26" (1/1) ... [2024-11-19 14:41:26,179 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:26" (1/1) ... [2024-11-19 14:41:26,183 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:26" (1/1) ... [2024-11-19 14:41:26,209 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 5, 10]. [2024-11-19 14:41:26,210 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:26" (1/1) ... [2024-11-19 14:41:26,210 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:26" (1/1) ... [2024-11-19 14:41:26,221 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:26" (1/1) ... [2024-11-19 14:41:26,225 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:26" (1/1) ... [2024-11-19 14:41:26,227 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:26" (1/1) ... [2024-11-19 14:41:26,229 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:26" (1/1) ... [2024-11-19 14:41:26,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:41:26,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:41:26,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:41:26,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:41:26,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:26" (1/1) ... [2024-11-19 14:41:26,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:41:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:41:26,272 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:26,275 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:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:41:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:41:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:41:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:41:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:41:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:41:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 14:41:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:41:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 14:41:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 14:41:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 14:41:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 14:41:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 14:41:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 14:41:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:41:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:41:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 14:41:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 14:41:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:41:26,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:41:26,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:41:26,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:41:26,857 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-19 14:41:26,857 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:41:26,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:41:26,874 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 14:41:26,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:26 BoogieIcfgContainer [2024-11-19 14:41:26,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:41:26,875 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:41:26,875 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:41:26,879 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:41:26,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:26,880 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:41:25" (1/3) ... [2024-11-19 14:41:26,881 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4032f6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:41:26, skipping insertion in model container [2024-11-19 14:41:26,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:26,882 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:41:26" (2/3) ... [2024-11-19 14:41:26,883 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4032f6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:41:26, skipping insertion in model container [2024-11-19 14:41:26,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:41:26,883 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:41:26" (3/3) ... [2024-11-19 14:41:26,885 INFO L332 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2024-11-19 14:41:26,955 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:41:26,955 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:41:26,955 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:41:26,955 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:41:26,955 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:41:26,955 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:41:26,956 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:41:26,956 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:41:26,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 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:26,976 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-19 14:41:26,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:26,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:26,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:26,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:26,983 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:41:26,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 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:26,989 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-19 14:41:26,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:26,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:26,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:26,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:26,995 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(24, 2); 30#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~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 35#L568-4true [2024-11-19 14:41:26,996 INFO L747 eck$LassoCheckResult]: Loop: 35#L568-4true havoc main_#t~nondet4#1; 22#L555-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; 40#L558-2true assume !true; 42#L557-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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; 46#L563true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 41#L563-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; 14#L563-4true call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 50#L568true assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 21#L568-2true assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 35#L568-4true [2024-11-19 14:41:27,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:41:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719767974] [2024-11-19 14:41:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:27,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:27,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:27,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:27,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2024-11-19 14:41:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866216817] [2024-11-19 14:41:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:27,259 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:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866216817] [2024-11-19 14:41:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866216817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:41:27,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940204284] [2024-11-19 14:41:27,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:27,266 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:41:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:41:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:41:27,303 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 50 states have internal predecessors, (81), 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:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:27,315 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2024-11-19 14:41:27,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 70 transitions. [2024-11-19 14:41:27,321 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-19 14:41:27,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 62 transitions. [2024-11-19 14:41:27,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-19 14:41:27,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-19 14:41:27,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2024-11-19 14:41:27,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:27,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-11-19 14:41:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2024-11-19 14:41:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 14:41:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 41 states have internal predecessors, (62), 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:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-11-19 14:41:27,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-11-19 14:41:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:41:27,370 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-11-19 14:41:27,370 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:41:27,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 62 transitions. [2024-11-19 14:41:27,372 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2024-11-19 14:41:27,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:27,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:27,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:27,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:27,373 INFO L745 eck$LassoCheckResult]: Stem: 148#$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(24, 2); 122#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~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 123#L568-4 [2024-11-19 14:41:27,373 INFO L747 eck$LassoCheckResult]: Loop: 123#L568-4 havoc main_#t~nondet4#1; 138#L555-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; 145#L558-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#2(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; 139#L557-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#2(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; 135#L557-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; 136#L557-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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; 147#L563 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 146#L563-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; 140#L563-4 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 141#L568 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 150#L568-2 assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 123#L568-4 [2024-11-19 14:41:27,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:41:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742589504] [2024-11-19 14:41:27,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:41:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:27,407 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:41:27,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:27,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:27,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:27,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2024-11-19 14:41:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:27,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768310811] [2024-11-19 14:41:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:27,751 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:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768310811] [2024-11-19 14:41:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768310811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:41:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755346485] [2024-11-19 14:41:27,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:27,754 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:41:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:41:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:41:27,756 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:41:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:27,891 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2024-11-19 14:41:27,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 104 transitions. [2024-11-19 14:41:27,896 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 60 [2024-11-19 14:41:27,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 104 transitions. [2024-11-19 14:41:27,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2024-11-19 14:41:27,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-19 14:41:27,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 104 transitions. [2024-11-19 14:41:27,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:27,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-11-19 14:41:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 104 transitions. [2024-11-19 14:41:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2024-11-19 14:41:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 45 states have internal predecessors, (67), 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:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2024-11-19 14:41:27,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-11-19 14:41:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:41:27,909 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-11-19 14:41:27,909 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:41:27,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 67 transitions. [2024-11-19 14:41:27,910 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 39 [2024-11-19 14:41:27,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:27,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:27,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:27,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:27,912 INFO L745 eck$LassoCheckResult]: Stem: 275#$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(24, 2); 247#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~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 248#L568-4 [2024-11-19 14:41:27,912 INFO L747 eck$LassoCheckResult]: Loop: 248#L568-4 havoc main_#t~nondet4#1; 260#L555-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; 271#L558-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#2(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; 264#L557-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#2(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; 261#L557-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; 262#L557-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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; 276#L563 assume !main_#t~short13#1; 272#L563-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; 266#L563-4 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 267#L568 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 278#L568-2 assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#2(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 248#L568-4 [2024-11-19 14:41:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:41:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:27,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172638671] [2024-11-19 14:41:27,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:41:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:27,929 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:41:27,931 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:27,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:27,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2024-11-19 14:41:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479523301] [2024-11-19 14:41:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:27,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:28,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:28,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2024-11-19 14:41:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:28,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870042492] [2024-11-19 14:41:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:41:28,317 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:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:41:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870042492] [2024-11-19 14:41:28,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870042492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:41:28,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:41:28,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:41:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382774719] [2024-11-19 14:41:28,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:41:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:41:30,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:41:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:41:30,899 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. cyclomatic complexity: 30 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:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:41:31,074 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2024-11-19 14:41:31,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 141 transitions. [2024-11-19 14:41:31,076 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 80 [2024-11-19 14:41:31,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 141 transitions. [2024-11-19 14:41:31,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2024-11-19 14:41:31,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2024-11-19 14:41:31,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 141 transitions. [2024-11-19 14:41:31,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:41:31,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-19 14:41:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 141 transitions. [2024-11-19 14:41:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2024-11-19 14:41:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 57 states have internal predecessors, (83), 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:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2024-11-19 14:41:31,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 83 transitions. [2024-11-19 14:41:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:41:31,088 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2024-11-19 14:41:31,088 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:41:31,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2024-11-19 14:41:31,089 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 51 [2024-11-19 14:41:31,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:41:31,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:41:31,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:41:31,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:41:31,090 INFO L745 eck$LassoCheckResult]: Stem: 432#$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(24, 2); 404#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~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~nondet31#1, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~nondet34#1, main_#t~malloc35#1.base, main_#t~malloc35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#2(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#2(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 405#L568-4 [2024-11-19 14:41:31,091 INFO L747 eck$LassoCheckResult]: Loop: 405#L568-4 havoc main_#t~nondet4#1; 417#L555-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; 426#L558-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#2(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; 420#L557-1 assume !main_#t~short7#1; 418#L557-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; 419#L557-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(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; 447#L563 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 445#L563-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; 444#L563-4 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 436#L568 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 434#L568-2 assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1; 405#L568-4 [2024-11-19 14:41:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:41:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918946542] [2024-11-19 14:41:31,092 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:41:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:31,105 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:41:31,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:41:31,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:31,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:31,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2024-11-19 14:41:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:31,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793800991] [2024-11-19 14:41:31,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:31,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:31,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:31,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:41:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2024-11-19 14:41:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:41:31,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265058683] [2024-11-19 14:41:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:41:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:41:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:31,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:31,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:41:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:31,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:41:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:41:31,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:41:31 BoogieIcfgContainer [2024-11-19 14:41:31,801 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:41:31,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:41:31,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:41:31,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:41:31,802 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:26" (3/4) ... [2024-11-19 14:41:31,806 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:41:31,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:41:31,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:41:31,841 INFO L158 Benchmark]: Toolchain (without parser) took 6238.93ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 95.8MB in the beginning and 97.8MB in the end (delta: -2.0MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-19 14:41:31,842 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:41:31,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.12ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 126.8MB in the end (delta: -31.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-19 14:41:31,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.80ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 124.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:41:31,843 INFO L158 Benchmark]: Boogie Preprocessor took 65.01ms. Allocated memory is still 163.6MB. Free memory was 124.1MB in the beginning and 120.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:41:31,843 INFO L158 Benchmark]: RCFGBuilder took 640.41ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 92.0MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 14:41:31,844 INFO L158 Benchmark]: BuchiAutomizer took 4926.05ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 92.0MB in the beginning and 99.8MB in the end (delta: -7.8MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-11-19 14:41:31,844 INFO L158 Benchmark]: Witness Printer took 39.28ms. Allocated memory is still 216.0MB. Free memory was 99.8MB in the beginning and 97.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:41:31,846 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 109.1MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.12ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 126.8MB in the end (delta: -31.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.80ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 124.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.01ms. Allocated memory is still 163.6MB. Free memory was 124.1MB in the beginning and 120.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 640.41ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 92.0MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 4926.05ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 92.0MB in the beginning and 99.8MB in the end (delta: -7.8MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 39.28ms. Allocated memory is still 216.0MB. Free memory was 99.8MB in the beginning and 97.8MB in the end (delta: 1.9MB). 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 58 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. 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, 66 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, 157 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 136 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 226 mSDtfsCounter, 136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] !n->left && __VERIFIER_nondet_int() [L563] !n->left && __VERIFIER_nondet_int() [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] !n->right && __VERIFIER_nondet_int() [L568] !n->right && __VERIFIER_nondet_int() [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] !n->left && __VERIFIER_nondet_int() [L563] !n->left && __VERIFIER_nondet_int() [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] !n->right && __VERIFIER_nondet_int() [L568] !n->right && __VERIFIER_nondet_int() [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:41:31,879 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)