./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_cnstr.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.graphml --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 5d0e37f725f553afaea418dbbe7c392bdc4622ea ............................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:53:58,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:53:58,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:53:58,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:53:58,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:53:58,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:53:58,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:53:58,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:53:58,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:53:58,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:53:58,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:53:58,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:53:58,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:53:58,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:53:58,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:53:58,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:53:58,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:53:58,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:53:58,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:53:58,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:53:58,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:53:58,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:53:58,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:53:58,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:53:58,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:53:58,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:53:58,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:53:58,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:53:58,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:53:58,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:53:58,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:53:58,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:53:58,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:53:58,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:53:58,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:53:58,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:53:58,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:53:58,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:53:58,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:53:58,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:53:58,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:53:58,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:53:58,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:53:58,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:53:58,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:53:58,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:53:58,359 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:53:58,360 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:53:58,360 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:53:58,360 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:53:58,360 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:53:58,360 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:53:58,361 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:53:58,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:53:58,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:53:58,363 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:53:58,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:53:58,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:53:58,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:53:58,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:53:58,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:53:58,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:53:58,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:53:58,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:53:58,365 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:53:58,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:53:58,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:53:58,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:53:58,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:53:58,367 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:53:58,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:53:58,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:53:58,368 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:53:58,370 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:53:58,370 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 5d0e37f725f553afaea418dbbe7c392bdc4622ea [2019-11-28 03:53:58,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:53:58,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:53:58,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:53:58,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:53:58,689 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:53:58,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2019-11-28 03:53:58,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d09b350/f9477fa50ad04ff3844b9e49e1bc0189/FLAGba1ab0ba7 [2019-11-28 03:53:59,328 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:53:59,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2019-11-28 03:53:59,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d09b350/f9477fa50ad04ff3844b9e49e1bc0189/FLAGba1ab0ba7 [2019-11-28 03:53:59,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d09b350/f9477fa50ad04ff3844b9e49e1bc0189 [2019-11-28 03:53:59,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:53:59,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:53:59,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:53:59,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:53:59,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:53:59,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:59" (1/1) ... [2019-11-28 03:53:59,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a18cc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:59, skipping insertion in model container [2019-11-28 03:53:59,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:59" (1/1) ... [2019-11-28 03:53:59,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:53:59,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:54:00,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:00,161 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:54:00,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:00,258 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:54:00,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00 WrapperNode [2019-11-28 03:54:00,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:00,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:00,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:54:00,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:54:00,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:00,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:54:00,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:54:00,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:54:00,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:54:00,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:54:00,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:54:00,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:54:00,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:54:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:54:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:54:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:54:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:54:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:54:00,901 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:54:00,901 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:54:00,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:00 BoogieIcfgContainer [2019-11-28 03:54:00,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:54:00,903 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:54:00,903 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:54:00,907 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:54:00,908 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:00,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:53:59" (1/3) ... [2019-11-28 03:54:00,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6af4ab4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:00, skipping insertion in model container [2019-11-28 03:54:00,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:00,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00" (2/3) ... [2019-11-28 03:54:00,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6af4ab4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:00, skipping insertion in model container [2019-11-28 03:54:00,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:00,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:00" (3/3) ... [2019-11-28 03:54:00,914 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2019-11-28 03:54:00,971 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:54:00,971 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:54:00,971 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:54:00,971 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:54:00,972 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:54:00,972 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:54:00,972 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:54:00,972 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:54:00,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 03:54:01,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 03:54:01,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:01,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:01,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:01,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:01,014 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:54:01,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 03:54:01,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 03:54:01,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:01,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:01,017 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:01,017 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:01,025 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 11#L534-2true [2019-11-28 03:54:01,026 INFO L796 eck$LassoCheckResult]: Loop: 11#L534-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 8#L524-2true assume !true; 23#L523-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 21#L529true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 26#L529-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 6#L534true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 11#L534-2true [2019-11-28 03:54:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:54:01,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:01,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189856064] [2019-11-28 03:54:01,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 03:54:01,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:01,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257753557] [2019-11-28 03:54:01,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:01,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257753557] [2019-11-28 03:54:01,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:01,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:54:01,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906661033] [2019-11-28 03:54:01,283 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:01,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:01,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:54:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:54:01,298 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-11-28 03:54:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:01,305 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-11-28 03:54:01,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:54:01,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-11-28 03:54:01,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 03:54:01,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2019-11-28 03:54:01,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:54:01,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:54:01,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2019-11-28 03:54:01,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:01,316 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-11-28 03:54:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2019-11-28 03:54:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 03:54:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:54:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2019-11-28 03:54:01,340 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-11-28 03:54:01,340 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-11-28 03:54:01,340 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:54:01,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2019-11-28 03:54:01,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 03:54:01,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:01,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:01,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:01,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:01,343 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 66#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 62#L534-2 [2019-11-28 03:54:01,343 INFO L796 eck$LassoCheckResult]: Loop: 62#L534-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 59#L524-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 64#L523-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 65#L523-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 72#L523-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 74#L529 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 75#L529-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 61#L534 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 62#L534-2 [2019-11-28 03:54:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:54:01,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:01,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459990280] [2019-11-28 03:54:01,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 03:54:01,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:01,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056375809] [2019-11-28 03:54:01,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:01,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056375809] [2019-11-28 03:54:01,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:01,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:01,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323284790] [2019-11-28 03:54:01,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:01,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:01,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:01,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:01,498 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 03:54:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:01,645 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2019-11-28 03:54:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:01,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2019-11-28 03:54:01,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-11-28 03:54:01,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2019-11-28 03:54:01,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 03:54:01,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 03:54:01,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2019-11-28 03:54:01,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:01,653 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2019-11-28 03:54:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2019-11-28 03:54:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-28 03:54:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:54:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2019-11-28 03:54:01,657 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-28 03:54:01,658 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-28 03:54:01,658 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:54:01,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2019-11-28 03:54:01,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:54:01,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:01,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:01,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:01,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:01,660 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 124#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 119#L534-2 [2019-11-28 03:54:01,660 INFO L796 eck$LassoCheckResult]: Loop: 119#L534-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 116#L524-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 121#L523-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 122#L523-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 134#L523-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L529 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 133#L529-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 118#L534 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 119#L534-2 [2019-11-28 03:54:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 03:54:01,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:01,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830887274] [2019-11-28 03:54:01,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:01,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 03:54:01,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:01,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217293887] [2019-11-28 03:54:01,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:01,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 03:54:01,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:01,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421335627] [2019-11-28 03:54:01,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:01,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421335627] [2019-11-28 03:54:01,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:01,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:01,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806199340] [2019-11-28 03:54:02,051 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 03:54:02,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:02,152 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-28 03:54:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:02,404 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2019-11-28 03:54:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:54:02,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2019-11-28 03:54:02,410 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2019-11-28 03:54:02,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2019-11-28 03:54:02,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 03:54:02,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 03:54:02,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2019-11-28 03:54:02,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:02,418 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2019-11-28 03:54:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2019-11-28 03:54:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2019-11-28 03:54:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 03:54:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-11-28 03:54:02,427 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-11-28 03:54:02,427 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-11-28 03:54:02,427 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:54:02,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2019-11-28 03:54:02,429 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2019-11-28 03:54:02,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,433 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,434 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 216#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 210#L534-2 [2019-11-28 03:54:02,434 INFO L796 eck$LassoCheckResult]: Loop: 210#L534-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 213#L524-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 214#L523-1 assume !main_#t~short6; 215#L523-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 234#L523-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 233#L529 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 228#L529-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 209#L534 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 210#L534-2 [2019-11-28 03:54:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,435 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 03:54:02,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244026044] [2019-11-28 03:54:02,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 03:54:02,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933534867] [2019-11-28 03:54:02,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 03:54:02,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142666006] [2019-11-28 03:54:02,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,714 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 03:54:02,958 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 03:54:03,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:54:03 BoogieIcfgContainer [2019-11-28 03:54:03,089 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:54:03,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:54:03,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:54:03,090 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:54:03,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:00" (3/4) ... [2019-11-28 03:54:03,094 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:54:03,145 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:54:03,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:54:03,153 INFO L168 Benchmark]: Toolchain (without parser) took 3469.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 960.4 MB in the beginning and 916.3 MB in the end (delta: 44.1 MB). Peak memory consumption was 190.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:03,153 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:03,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:03,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:03,159 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:03,160 INFO L168 Benchmark]: RCFGBuilder took 549.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:03,161 INFO L168 Benchmark]: BuchiAutomizer took 2185.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 173.8 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:03,162 INFO L168 Benchmark]: Witness Printer took 56.53 ms. Allocated memory is still 1.2 GB. Free memory is still 916.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:03,172 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 549.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2185.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 173.8 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. * Witness Printer took 56.53 ms. Allocated memory is still 1.2 GB. Free memory is still 916.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 55 SDslu, 69 SDs, 0 SdLazy, 134 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time 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 - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 521]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@430ebcee=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56709322=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@599390fa=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@19807094=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@afa8f39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5ffc21ab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5b54b49b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7fdc5982=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66fcf281=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@430ebcee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8d5c17a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17cf7201=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51790193=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65fcf676=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@619a67d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4da55cde=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66fcf281=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17cf7201=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51790193=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7fdc5982=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c578f64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@599390fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dcd06ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51d51bf5=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@afa8f39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2410bb25=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5ffc21ab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4da55cde=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b2d5fc3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31a501d=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@418ec22=17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c578f64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e71a3dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@19807094=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5b54b49b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2410bb25=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3b65c915=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b2d5fc3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e71a3dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2048db17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56709322=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dcd06ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51d51bf5=0, pred=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@619a67d2=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 521]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L518] struct TreeNode* root = malloc(sizeof(*root)), *n; [L519] root->left = ((void *)0) [L520] root->right = ((void *)0) Loop: [L521] COND TRUE __VERIFIER_nondet_int() [L522] n = root [L523] EXPR n->left [L523] n->left && n->right [L523] COND FALSE !(n->left && n->right) [L529] EXPR n->left [L529] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L534] EXPR n->right [L534] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...