./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.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_stack.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 3e23c3bca784f04992b2007c94519fee617936af .............................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54:01,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:54:01,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:54:01,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:54:01,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:54:01,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:54:01,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:54:01,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:54:01,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:54:01,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:54:01,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:54:01,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:54:01,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:54:01,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:54:01,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:54:01,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:54:01,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:54:01,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:54:01,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:54:01,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:54:01,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:54:01,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:54:01,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:54:01,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:54:01,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:54:01,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:54:01,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:54:01,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:54:01,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:54:01,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:54:01,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:54:01,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:54:01,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:54:01,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:54:01,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:54:01,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:54:01,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:54:01,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:54:01,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:54:01,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:54:01,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:54:01,111 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:54:01,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:54:01,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:54:01,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:54:01,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:54:01,130 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:54:01,130 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:54:01,130 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:54:01,131 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:54:01,131 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:54:01,131 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:54:01,131 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:54:01,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:54:01,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:54:01,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:54:01,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:54:01,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:54:01,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:54:01,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:54:01,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:54:01,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:54:01,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:54:01,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:54:01,134 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:54:01,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:54:01,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:54:01,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:54:01,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:54:01,135 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:54:01,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:54:01,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:54:01,136 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:54:01,137 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:54:01,137 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 -> 3e23c3bca784f04992b2007c94519fee617936af [2019-11-28 03:54:01,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:54:01,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:54:01,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:54:01,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:54:01,505 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:54:01,506 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-11-28 03:54:01,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c185e55e/7283d890a65244638fa4d125775dd21c/FLAGc34adf292 [2019-11-28 03:54:02,164 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:54:02,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-11-28 03:54:02,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c185e55e/7283d890a65244638fa4d125775dd21c/FLAGc34adf292 [2019-11-28 03:54:02,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c185e55e/7283d890a65244638fa4d125775dd21c [2019-11-28 03:54:02,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:54:02,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:54:02,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:02,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:54:02,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:54:02,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:02" (1/1) ... [2019-11-28 03:54:02,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d9c01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:02, skipping insertion in model container [2019-11-28 03:54:02,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:02" (1/1) ... [2019-11-28 03:54:02,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:54:02,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:54:02,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:02,905 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:54:02,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:03,034 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:54:03,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:03 WrapperNode [2019-11-28 03:54:03,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:03,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:03,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:54:03,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:54:03,048 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:03" (1/1) ... [2019-11-28 03:54:03,084 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:03" (1/1) ... [2019-11-28 03:54:03,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:03,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:54:03,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:54:03,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:54:03,131 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:03" (1/1) ... [2019-11-28 03:54:03,131 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:03" (1/1) ... [2019-11-28 03:54:03,141 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:03" (1/1) ... [2019-11-28 03:54:03,141 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:03" (1/1) ... [2019-11-28 03:54:03,155 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:03" (1/1) ... [2019-11-28 03:54:03,164 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:03" (1/1) ... [2019-11-28 03:54:03,167 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:03" (1/1) ... [2019-11-28 03:54:03,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:54:03,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:54:03,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:54:03,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:54:03,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:03" (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:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:54:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:54:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:54:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:54:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:54:03,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:54:03,725 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:54:03,725 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 03:54:03,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:03 BoogieIcfgContainer [2019-11-28 03:54:03,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:54:03,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:54:03,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:54:03,732 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:54:03,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:03,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:54:02" (1/3) ... [2019-11-28 03:54:03,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c3bc9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:03, skipping insertion in model container [2019-11-28 03:54:03,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:03,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:03" (2/3) ... [2019-11-28 03:54:03,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c3bc9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:03, skipping insertion in model container [2019-11-28 03:54:03,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:03,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:03" (3/3) ... [2019-11-28 03:54:03,737 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2019-11-28 03:54:03,780 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:54:03,780 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:54:03,780 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:54:03,780 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:54:03,781 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:54:03,781 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:54:03,781 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:54:03,781 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:54:03,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:54:03,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:03,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:03,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:03,824 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:03,824 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:03,824 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:54:03,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:54:03,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:03,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:03,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:03,827 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:03,827 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:03,833 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 5#L538-2true [2019-11-28 03:54:03,834 INFO L796 eck$LassoCheckResult]: Loop: 5#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; 13#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#L533true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 17#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#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; 5#L538-2true [2019-11-28 03:54:03,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:54:03,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4247458] [2019-11-28 03:54:03,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 03:54:03,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185806470] [2019-11-28 03:54:03,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:04,046 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:04,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185806470] [2019-11-28 03:54:04,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:04,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:54:04,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977814609] [2019-11-28 03:54:04,065 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:04,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:04,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:54:04,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:54:04,090 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-28 03:54:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:04,103 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-11-28 03:54:04,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:54:04,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-11-28 03:54:04,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:04,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-11-28 03:54:04,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:54:04,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:54:04,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-28 03:54:04,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:04,124 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:54:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-28 03:54:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:54:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:54:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-28 03:54:04,161 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:54:04,161 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:54:04,162 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:54:04,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-28 03:54:04,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:04,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:04,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:04,167 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:04,167 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:04,168 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 53#L538-2 [2019-11-28 03:54:04,168 INFO L796 eck$LassoCheckResult]: Loop: 53#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; 50#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; 51#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; 52#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; 58#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#L533 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 61#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#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; 53#L538-2 [2019-11-28 03:54:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:54:04,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:04,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811472857] [2019-11-28 03:54:04,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:04,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 03:54:04,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:04,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703672327] [2019-11-28 03:54:04,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:04,410 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:04,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703672327] [2019-11-28 03:54:04,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:04,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:04,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700278731] [2019-11-28 03:54:04,412 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:04,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:04,413 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:54:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:04,545 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-11-28 03:54:04,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:04,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-11-28 03:54:04,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:54:04,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-11-28 03:54:04,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 03:54:04,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:54:04,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-11-28 03:54:04,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:04,551 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-28 03:54:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-11-28 03:54:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-28 03:54:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:54:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-28 03:54:04,556 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 03:54:04,556 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 03:54:04,556 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:54:04,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-28 03:54:04,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 03:54:04,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:04,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:04,561 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:04,561 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:04,561 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 115#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 105#L538-2 [2019-11-28 03:54:04,561 INFO L796 eck$LassoCheckResult]: Loop: 105#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; 101#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; 102#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; 103#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; 120#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 112#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 113#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 117#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; 105#L538-2 [2019-11-28 03:54:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 03:54:04,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:04,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147357541] [2019-11-28 03:54:04,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:04,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 03:54:04,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:04,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549356924] [2019-11-28 03:54:04,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:04,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 03:54:04,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:04,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375424098] [2019-11-28 03:54:04,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:04,722 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:04,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375424098] [2019-11-28 03:54:04,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:04,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:04,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922538492] [2019-11-28 03:54:04,939 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 03:54:05,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:05,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:05,042 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:54:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:05,249 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-11-28 03:54:05,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:54:05,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-11-28 03:54:05,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-28 03:54:05,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-11-28 03:54:05,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 03:54:05,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-28 03:54:05,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-11-28 03:54:05,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:05,259 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-11-28 03:54:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-11-28 03:54:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-11-28 03:54:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:54:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-28 03:54:05,267 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 03:54:05,267 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 03:54:05,267 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:54:05,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-28 03:54:05,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-28 03:54:05,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:05,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:05,273 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:05,273 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:05,274 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 171#L538-2 [2019-11-28 03:54:05,274 INFO L796 eck$LassoCheckResult]: Loop: 171#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; 168#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; 169#L527-1 assume !main_#t~short6; 170#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; 195#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 194#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 184#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 185#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; 171#L538-2 [2019-11-28 03:54:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 03:54:05,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:05,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505776887] [2019-11-28 03:54:05,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:05,324 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 03:54:05,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:05,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079582420] [2019-11-28 03:54:05,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:05,364 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 03:54:05,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:05,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980214932] [2019-11-28 03:54:05,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:05,429 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:05,608 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 03:54:05,720 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 03:54:05,860 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 03:54:05,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:54:05 BoogieIcfgContainer [2019-11-28 03:54:05,971 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:54:05,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:54:05,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:54:05,972 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:54:05,973 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:03" (3/4) ... [2019-11-28 03:54:05,976 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:54:06,025 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:54:06,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:54:06,029 INFO L168 Benchmark]: Toolchain (without parser) took 3600.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 955.0 MB in the beginning and 911.2 MB in the end (delta: 43.8 MB). Peak memory consumption was 181.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:06,030 INFO L168 Benchmark]: CDTParser took 0.29 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:06,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:06,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.92 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.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:06,033 INFO L168 Benchmark]: Boogie Preprocessor took 52.46 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:06,034 INFO L168 Benchmark]: RCFGBuilder took 552.86 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:06,035 INFO L168 Benchmark]: BuchiAutomizer took 2244.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.2 MB in the end (delta: 171.1 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:06,036 INFO L168 Benchmark]: Witness Printer took 54.48 ms. Allocated memory is still 1.2 GB. Free memory is still 911.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:06,042 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.29 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 609.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.92 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.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.46 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 552.86 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2244.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.2 MB in the end (delta: 171.1 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. * Witness Printer took 54.48 ms. Allocated memory is still 1.2 GB. Free memory is still 911.2 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 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 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@3fbdeaa8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@661075c6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f331311=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74bc5b70=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c0972d5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74068052=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@147b23d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b9dea6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36ab9b8d=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42bf49ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fbdeaa8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49fbf793=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3480e80a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b30abd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b048c6f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35733ba1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7174ef73=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3480e80a=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f85f96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b30abd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@147b23d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42bf49ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36ab9b8d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74bc5b70=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@530c85fd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f331311=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d5c82cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63b75245=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c916dbd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74068052=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7174ef73=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e2eea5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13628dff=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65b32a8d=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@530c85fd=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2573f3cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c0972d5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b9dea6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c916dbd=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e2eea5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2573f3cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d7dc7d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7ee73706=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f85f96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@661075c6=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d5c82cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63b75245=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d7dc7d0=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35733ba1=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...