./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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_dsw.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 9b66bca76c5a21a62f865fe4d9cdb8724001340a ............................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 21:26:23,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:26:23,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:26:23,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:26:23,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:26:23,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:26:23,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:26:23,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:26:23,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:26:23,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:26:23,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:26:23,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:26:23,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:26:23,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:26:23,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:26:23,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:26:23,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:26:23,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:26:23,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:26:23,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:26:23,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:26:23,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:26:23,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:26:23,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:26:23,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:26:23,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:26:23,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:26:23,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:26:23,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:26:23,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:26:23,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:26:23,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:26:23,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:26:23,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:26:23,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:26:23,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:26:23,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:26:23,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:26:23,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:26:23,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:26:23,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:26:23,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:26:23,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:26:23,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:26:23,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:26:23,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:26:23,433 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:26:23,433 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:26:23,433 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:26:23,433 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:26:23,434 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:26:23,434 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:26:23,434 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:26:23,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:26:23,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:26:23,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:26:23,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:26:23,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:26:23,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:26:23,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:26:23,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:26:23,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:26:23,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:26:23,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:26:23,438 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:26:23,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:26:23,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:26:23,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:26:23,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:26:23,439 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:26:23,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:26:23,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:26:23,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:26:23,440 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:26:23,441 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:26:23,441 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 -> 9b66bca76c5a21a62f865fe4d9cdb8724001340a [2019-11-28 21:26:23,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:26:23,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:26:23,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:26:23,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:26:23,800 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:26:23,802 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-11-28 21:26:23,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c5bb7c7/22783d72a24e4f3da899fd749b828135/FLAG486f252b8 [2019-11-28 21:26:24,390 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:26:24,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-11-28 21:26:24,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c5bb7c7/22783d72a24e4f3da899fd749b828135/FLAG486f252b8 [2019-11-28 21:26:24,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c5bb7c7/22783d72a24e4f3da899fd749b828135 [2019-11-28 21:26:24,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:26:24,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:26:24,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:24,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:26:24,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:26:24,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:24" (1/1) ... [2019-11-28 21:26:24,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1dbb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:24, skipping insertion in model container [2019-11-28 21:26:24,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:24" (1/1) ... [2019-11-28 21:26:24,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:26:24,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:26:25,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:25,224 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:26:25,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:25,369 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:26:25,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25 WrapperNode [2019-11-28 21:26:25,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:25,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:25,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:26:25,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:26:25,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:25,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:26:25,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:26:25,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:26:25,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (1/1) ... [2019-11-28 21:26:25,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:26:25,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:26:25,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:26:25,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:26:25,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (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 21:26:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 21:26:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:26:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 21:26:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 21:26:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:26:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:26:25,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:26:26,091 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:26:26,092 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 21:26:26,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:26 BoogieIcfgContainer [2019-11-28 21:26:26,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:26:26,094 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:26:26,094 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:26:26,098 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:26:26,098 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:26,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:26:24" (1/3) ... [2019-11-28 21:26:26,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c57bafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:26, skipping insertion in model container [2019-11-28 21:26:26,100 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:26,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:25" (2/3) ... [2019-11-28 21:26:26,101 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c57bafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:26, skipping insertion in model container [2019-11-28 21:26:26,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:26,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:26" (3/3) ... [2019-11-28 21:26:26,104 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2019-11-28 21:26:26,145 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:26:26,145 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:26:26,145 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:26:26,146 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:26:26,146 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:26:26,146 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:26:26,146 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:26:26,147 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:26:26,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 21:26:26,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 21:26:26,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:26,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:26,195 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:26,195 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:26:26,195 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:26:26,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 21:26:26,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 21:26:26,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:26,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:26,198 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:26,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:26:26,205 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 18#L538-2true [2019-11-28 21:26:26,206 INFO L796 eck$LassoCheckResult]: Loop: 18#L538-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; 3#L528-2true assume !true; 22#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 7#L533true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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; 25#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 27#L538true 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; 18#L538-2true [2019-11-28 21:26:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 21:26:26,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039914833] [2019-11-28 21:26:26,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 21:26:26,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956529313] [2019-11-28 21:26:26,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:26,399 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 21:26:26,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956529313] [2019-11-28 21:26:26,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:26,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:26:26,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340648527] [2019-11-28 21:26:26,408 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:26:26,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 21:26:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 21:26:26,429 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-28 21:26:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:26,438 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2019-11-28 21:26:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 21:26:26,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-11-28 21:26:26,443 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 21:26:26,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2019-11-28 21:26:26,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 21:26:26,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 21:26:26,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2019-11-28 21:26:26,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:26,451 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-28 21:26:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2019-11-28 21:26:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 21:26:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 21:26:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2019-11-28 21:26:26,483 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-28 21:26:26,483 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-28 21:26:26,483 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:26:26,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2019-11-28 21:26:26,484 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 21:26:26,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:26,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:26,485 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:26,485 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:26,485 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 75#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 63#L538-2 [2019-11-28 21:26:26,485 INFO L796 eck$LassoCheckResult]: Loop: 63#L538-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; 58#L528-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; 59#L527-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; 60#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 68#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L533 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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; 73#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 78#L538 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; 63#L538-2 [2019-11-28 21:26:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 21:26:26,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197174223] [2019-11-28 21:26:26,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,516 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 21:26:26,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268880690] [2019-11-28 21:26:26,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:26,646 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 21:26:26,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268880690] [2019-11-28 21:26:26,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:26,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:26:26,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732507670] [2019-11-28 21:26:26,647 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:26:26,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:26,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:26:26,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:26:26,649 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-28 21:26:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:26,784 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2019-11-28 21:26:26,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:26:26,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2019-11-28 21:26:26,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-28 21:26:26,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2019-11-28 21:26:26,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 21:26:26,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 21:26:26,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2019-11-28 21:26:26,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:26,791 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-28 21:26:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2019-11-28 21:26:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-11-28 21:26:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 21:26:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2019-11-28 21:26:26,796 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-11-28 21:26:26,796 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-11-28 21:26:26,796 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:26:26,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2019-11-28 21:26:26,797 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-28 21:26:26,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:26,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:26,798 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:26,798 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:26,799 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 135#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 123#L538-2 [2019-11-28 21:26:26,799 INFO L796 eck$LassoCheckResult]: Loop: 123#L538-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; 117#L528-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; 118#L527-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; 119#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 128#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 133#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 138#L538 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; 123#L538-2 [2019-11-28 21:26:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,799 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 21:26:26,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119780709] [2019-11-28 21:26:26,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,855 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 21:26:26,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487976288] [2019-11-28 21:26:26,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 21:26:26,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335926596] [2019-11-28 21:26:26,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:26,981 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 21:26:26,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335926596] [2019-11-28 21:26:26,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:26,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:26:26,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731255622] [2019-11-28 21:26:27,182 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 21:26:27,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:27,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:26:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:26:27,290 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 21:26:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:27,509 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-11-28 21:26:27,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 21:26:27,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2019-11-28 21:26:27,511 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-11-28 21:26:27,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 21:26:27,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-28 21:26:27,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-28 21:26:27,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2019-11-28 21:26:27,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:27,514 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 21:26:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2019-11-28 21:26:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-28 21:26:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 21:26:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-11-28 21:26:27,518 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-11-28 21:26:27,518 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-11-28 21:26:27,518 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:26:27,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2019-11-28 21:26:27,519 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-11-28 21:26:27,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:27,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:27,520 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:27,520 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:27,521 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 214#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~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, 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~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 215#L538-2 [2019-11-28 21:26:27,522 INFO L796 eck$LassoCheckResult]: Loop: 215#L538-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; 195#L528-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; 196#L527-1 assume !main_#t~short6; 197#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 226#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 223#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L538 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; 215#L538-2 [2019-11-28 21:26:27,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 21:26:27,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:27,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899468761] [2019-11-28 21:26:27,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 21:26:27,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:27,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182417252] [2019-11-28 21:26:27,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:27,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 21:26:27,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:27,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332844696] [2019-11-28 21:26:27,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,659 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:27,802 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 21:26:28,050 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 21:26:28,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:26:28 BoogieIcfgContainer [2019-11-28 21:26:28,208 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:26:28,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:26:28,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:26:28,209 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:26:28,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:26" (3/4) ... [2019-11-28 21:26:28,214 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 21:26:28,258 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 21:26:28,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:26:28,260 INFO L168 Benchmark]: Toolchain (without parser) took 3532.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 953.7 MB in the beginning and 887.4 MB in the end (delta: 66.2 MB). Peak memory consumption was 186.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:28,261 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:28,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:28,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:28,263 INFO L168 Benchmark]: Boogie Preprocessor took 36.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:28,264 INFO L168 Benchmark]: RCFGBuilder took 601.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:28,265 INFO L168 Benchmark]: BuchiAutomizer took 2114.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 887.4 MB in the end (delta: 175.7 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:28,265 INFO L168 Benchmark]: Witness Printer took 49.95 ms. Allocated memory is still 1.1 GB. Free memory is still 887.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:28,269 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.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 601.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2114.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 887.4 MB in the end (delta: 175.7 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. * Witness Printer took 49.95 ms. Allocated memory is still 1.1 GB. Free memory is still 887.4 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 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. 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, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 34 SDslu, 75 SDs, 0 SdLazy, 124 SolverSat, 14 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: 525]: 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 {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ab2838f=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f27b0ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b90349e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c1677f6=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@41ecd849=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@799fd64d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28c757f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@126750ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38801ec9=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@149606c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ab2838f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26238e08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b2d772f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@653d4bae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3290ce98=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bdfb77d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6993e5dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@149606c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15b80bc2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b2d772f=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c1677f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@653d4bae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28c757f9=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7265c553=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38801ec9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b348c91=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b5e47c5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b90349e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39a66944=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dfb50c5=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@799fd64d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b335bc1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7265c553=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6993e5dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31bf9e2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57b699fa=0, succ=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a8620e6=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b5e47c5=0, s=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3ce1c3e2=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@41ecd849=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@126750ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c5092f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b335bc1=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31bf9e2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c5092f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3ce1c3e2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7c2ee6c6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b348c91=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15b80bc2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f27b0ce=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39a66944=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dfb50c5=0, pred=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bdfb77d=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 525]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L522] struct TreeNode* root = malloc(sizeof(*root)), *n; [L523] root->left = ((void *)0) [L524] root->right = ((void *)0) Loop: [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] COND FALSE !(n->left && n->right) [L533] EXPR n->left [L533] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L538] EXPR n->right [L538] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...