./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 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_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.24-30f4e4a [2019-11-28 03:53:59,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:53:59,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:53:59,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:53:59,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:53:59,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:53:59,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:53:59,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:53:59,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:53:59,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:53:59,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:53:59,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:53:59,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:53:59,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:53:59,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:53:59,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:53:59,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:53:59,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:53:59,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:53:59,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:53:59,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:53:59,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:53:59,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:53:59,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:53:59,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:53:59,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:53:59,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:53:59,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:53:59,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:53:59,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:53:59,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:53:59,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:53:59,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:53:59,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:53:59,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:53:59,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:53:59,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:53:59,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:53:59,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:53:59,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:53:59,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:53:59,323 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:59,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:53:59,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:53:59,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:53:59,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:53:59,342 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:53:59,342 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:53:59,343 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:53:59,343 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:53:59,343 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:53:59,343 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:53:59,344 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:53:59,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:53:59,344 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:53:59,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:53:59,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:53:59,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:53:59,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:53:59,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:53:59,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:53:59,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:53:59,347 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:53:59,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:53:59,347 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:53:59,348 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:53:59,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:53:59,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:53:59,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:53:59,349 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:53:59,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:53:59,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:53:59,350 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:53:59,351 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:53:59,351 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 03:53:59,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:53:59,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:53:59,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:53:59,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:53:59,711 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:53:59,711 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 03:53:59,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e96a69ca/780a58627dd34e2d9bce9749405307f5/FLAG4b28c67a3 [2019-11-28 03:54:00,285 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:54:00,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-11-28 03:54:00,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e96a69ca/780a58627dd34e2d9bce9749405307f5/FLAG4b28c67a3 [2019-11-28 03:54:00,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e96a69ca/780a58627dd34e2d9bce9749405307f5 [2019-11-28 03:54:00,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:54:00,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:54:00,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:00,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:54:00,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:54:00,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f384efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00, skipping insertion in model container [2019-11-28 03:54:00,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:54:00,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:54:01,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:01,124 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:54:01,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:01,232 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:54:01,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01 WrapperNode [2019-11-28 03:54:01,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:01,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:01,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:54:01,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:54:01,245 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:01" (1/1) ... [2019-11-28 03:54:01,276 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:01" (1/1) ... [2019-11-28 03:54:01,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:01,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:54:01,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:54:01,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:54:01,313 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:01" (1/1) ... [2019-11-28 03:54:01,313 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:01" (1/1) ... [2019-11-28 03:54:01,317 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:01" (1/1) ... [2019-11-28 03:54:01,318 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:01" (1/1) ... [2019-11-28 03:54:01,329 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:01" (1/1) ... [2019-11-28 03:54:01,334 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:01" (1/1) ... [2019-11-28 03:54:01,336 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:01" (1/1) ... [2019-11-28 03:54:01,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:54:01,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:54:01,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:54:01,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:54:01,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (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:01,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:54:01,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:54:01,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:54:01,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:54:01,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:54:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:54:01,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:54:01,901 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:54:01,901 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:54:01,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:01 BoogieIcfgContainer [2019-11-28 03:54:01,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:54:01,904 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:54:01,904 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:54:01,907 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:54:01,908 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:01,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:54:00" (1/3) ... [2019-11-28 03:54:01,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c004aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:01, skipping insertion in model container [2019-11-28 03:54:01,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:01,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:01" (2/3) ... [2019-11-28 03:54:01,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c004aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:01, skipping insertion in model container [2019-11-28 03:54:01,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:01,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:01" (3/3) ... [2019-11-28 03:54:01,913 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2019-11-28 03:54:01,974 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:54:01,974 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:54:01,974 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:54:01,975 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:54:01,975 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:54:01,975 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:54:01,975 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:54:01,975 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:54:01,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 03:54:02,008 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 03:54:02,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,015 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,015 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:54:02,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-28 03:54:02,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 03:54:02,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,024 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 03:54:02,025 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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 18#L538-2true [2019-11-28 03:54:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,030 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:54:02,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774253713] [2019-11-28 03:54:02,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 03:54:02,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840869106] [2019-11-28 03:54:02,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:02,222 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:02,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840869106] [2019-11-28 03:54:02,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:02,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:54:02,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698730963] [2019-11-28 03:54:02,232 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:02,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:54:02,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:54:02,254 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-28 03:54:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:02,265 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2019-11-28 03:54:02,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:54:02,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-11-28 03:54:02,270 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 03:54:02,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2019-11-28 03:54:02,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 03:54:02,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 03:54:02,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2019-11-28 03:54:02,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:02,279 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-28 03:54:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2019-11-28 03:54:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 03:54:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:54:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2019-11-28 03:54:02,314 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-28 03:54:02,314 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-28 03:54:02,315 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:54:02,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2019-11-28 03:54:02,316 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-28 03:54:02,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,317 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,317 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,317 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 03:54:02,318 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~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 63#L538-2 [2019-11-28 03:54:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:54:02,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327292107] [2019-11-28 03:54:02,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 03:54:02,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097681467] [2019-11-28 03:54:02,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:02,459 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:02,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097681467] [2019-11-28 03:54:02,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:02,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:02,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361803940] [2019-11-28 03:54:02,461 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:02,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:02,464 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-28 03:54:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:02,608 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2019-11-28 03:54:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:02,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2019-11-28 03:54:02,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-28 03:54:02,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2019-11-28 03:54:02,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:54:02,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:54:02,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2019-11-28 03:54:02,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:02,616 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-28 03:54:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2019-11-28 03:54:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-11-28 03:54:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 03:54:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2019-11-28 03:54:02,621 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-11-28 03:54:02,621 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-11-28 03:54:02,621 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:54:02,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2019-11-28 03:54:02,622 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-28 03:54:02,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,624 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 03:54:02,624 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~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 123#L538-2 [2019-11-28 03:54:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 03:54:02,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257537746] [2019-11-28 03:54:02,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 03:54:02,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966263416] [2019-11-28 03:54:02,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 03:54:02,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588186123] [2019-11-28 03:54:02,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:02,810 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:02,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588186123] [2019-11-28 03:54:02,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:02,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:02,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698710884] [2019-11-28 03:54:03,043 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 03:54:03,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:03,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:03,149 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 03:54:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:03,424 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-11-28 03:54:03,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:54:03,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2019-11-28 03:54:03,427 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-11-28 03:54:03,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 03:54:03,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-28 03:54:03,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-28 03:54:03,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2019-11-28 03:54:03,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:03,433 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 03:54:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2019-11-28 03:54:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-28 03:54:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 03:54:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-11-28 03:54:03,441 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-11-28 03:54:03,441 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-11-28 03:54:03,442 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:54:03,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2019-11-28 03:54:03,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-11-28 03:54:03,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:03,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:03,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:03,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:03,447 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 03:54:03,448 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~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 215#L538-2 [2019-11-28 03:54:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 03:54:03,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920440548] [2019-11-28 03:54:03,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 03:54:03,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195096143] [2019-11-28 03:54:03,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 03:54:03,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616063689] [2019-11-28 03:54:03,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:03,725 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 03:54:03,963 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 03:54:04,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:54:04 BoogieIcfgContainer [2019-11-28 03:54:04,078 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:54:04,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:54:04,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:54:04,079 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:54:04,079 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:01" (3/4) ... [2019-11-28 03:54:04,083 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:54:04,135 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:54:04,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:54:04,137 INFO L168 Benchmark]: Toolchain (without parser) took 3536.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.4 MB in the beginning and 912.7 MB in the end (delta: 47.7 MB). Peak memory consumption was 195.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,138 INFO L168 Benchmark]: CDTParser took 0.27 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:04,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.19 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,141 INFO L168 Benchmark]: Boogie Preprocessor took 34.96 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:04,142 INFO L168 Benchmark]: RCFGBuilder took 562.30 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,143 INFO L168 Benchmark]: BuchiAutomizer took 2174.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.7 MB in the end (delta: 176.5 MB). Peak memory consumption was 176.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,143 INFO L168 Benchmark]: Witness Printer took 56.60 ms. Allocated memory is still 1.2 GB. Free memory is still 912.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:04,149 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.27 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 632.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.19 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.96 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 562.30 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2174.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.7 MB in the end (delta: 176.5 MB). Peak memory consumption was 176.5 MB. Max. memory is 11.5 GB. * Witness Printer took 56.60 ms. Allocated memory is still 1.2 GB. Free memory is still 912.7 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@67498ad0=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c2d3dcb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a55216b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56415182=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@531add26=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54a8d303=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5832b2af=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f0d8da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39f19890=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b5d5e8c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67498ad0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b616b96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a70a154=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@293d3240=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6566d8fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@530c85fd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@662f2d2f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b5d5e8c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@681f4e18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a70a154=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56415182=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@293d3240=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5832b2af=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fd8099a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39f19890=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c5b9d4a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@515300fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a55216b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6374d3f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c916dbd=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54a8d303=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c78d58a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fd8099a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@662f2d2f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@510d6568=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54a1fe3d=0, succ=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54c790f=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@515300fa=0, s=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ca8b852=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@531add26=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f0d8da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e7b802c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c78d58a=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@510d6568=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e7b802c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ca8b852=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@757be2a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c5b9d4a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@681f4e18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c2d3dcb=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6374d3f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c916dbd=0, pred=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@530c85fd=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...