./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.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 fbf3b6e80b82aab76aa646445120e7c15e1e84e0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-0ed9222-m [2019-01-14 04:59:14,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:59:14,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:59:14,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:59:14,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:59:14,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:59:14,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:59:14,711 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:59:14,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:59:14,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:59:14,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:59:14,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:59:14,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:59:14,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:59:14,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:59:14,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:59:14,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:59:14,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:59:14,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:59:14,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:59:14,727 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:59:14,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:59:14,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:59:14,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:59:14,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:59:14,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:59:14,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:59:14,742 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:59:14,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:59:14,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:59:14,746 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:59:14,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:59:14,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:59:14,747 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:59:14,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:59:14,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:59:14,748 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:59:14,781 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:59:14,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:59:14,783 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:59:14,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:59:14,787 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:59:14,787 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:59:14,787 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:59:14,787 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:59:14,788 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:59:14,788 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:59:14,788 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:59:14,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:59:14,788 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:59:14,788 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:59:14,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:59:14,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:59:14,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:59:14,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:59:14,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:59:14,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:59:14,790 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:59:14,792 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:59:14,792 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:59:14,792 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:59:14,793 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:59:14,793 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:59:14,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:59:14,794 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:59:14,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:59:14,794 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:59:14,794 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:59:14,795 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:59:14,795 INFO L133 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 -> fbf3b6e80b82aab76aa646445120e7c15e1e84e0 [2019-01-14 04:59:14,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:59:14,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:59:14,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:59:14,880 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:59:14,880 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:59:14,881 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2019-01-14 04:59:14,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b16c8c2/97845aceda6f4da58fcc50164d64f9e5/FLAG20f32cbde [2019-01-14 04:59:15,464 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:59:15,465 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2019-01-14 04:59:15,478 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b16c8c2/97845aceda6f4da58fcc50164d64f9e5/FLAG20f32cbde [2019-01-14 04:59:15,735 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b16c8c2/97845aceda6f4da58fcc50164d64f9e5 [2019-01-14 04:59:15,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:59:15,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:59:15,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:15,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:59:15,745 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:59:15,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:15" (1/1) ... [2019-01-14 04:59:15,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a13bd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:15, skipping insertion in model container [2019-01-14 04:59:15,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:15" (1/1) ... [2019-01-14 04:59:15,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:59:15,799 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:59:16,136 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:16,149 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:59:16,270 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:16,318 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:59:16,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16 WrapperNode [2019-01-14 04:59:16,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:16,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:16,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:59:16,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:59:16,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:16,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:59:16,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:59:16,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:59:16,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (1/1) ... [2019-01-14 04:59:16,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:59:16,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:59:16,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:59:16,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:59:16,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (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-01-14 04:59:16,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 04:59:16,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 04:59:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 04:59:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:59:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:59:16,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:59:17,051 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:59:17,052 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 04:59:17,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:17 BoogieIcfgContainer [2019-01-14 04:59:17,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:59:17,054 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:59:17,057 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:59:17,061 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:59:17,061 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:17,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:59:15" (1/3) ... [2019-01-14 04:59:17,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fac202a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:17, skipping insertion in model container [2019-01-14 04:59:17,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:17,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:16" (2/3) ... [2019-01-14 04:59:17,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fac202a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:17, skipping insertion in model container [2019-01-14 04:59:17,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:17,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:17" (3/3) ... [2019-01-14 04:59:17,066 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2019-01-14 04:59:17,120 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:59:17,120 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:59:17,120 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:59:17,121 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:59:17,121 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:59:17,121 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:59:17,122 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:59:17,122 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:59:17,122 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:59:17,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 04:59:17,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-14 04:59:17,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:17,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:17,164 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:59:17,164 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:59:17,164 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:59:17,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 04:59:17,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-14 04:59:17,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:17,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:17,167 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:59:17,167 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:59:17,175 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, 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~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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#L645-2true [2019-01-14 04:59:17,176 INFO L796 eck$LassoCheckResult]: Loop: 5#L645-2true assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L635-2true assume !true; 13#L634-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#L640true assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 16#L640-2true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#L645true assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 5#L645-2true [2019-01-14 04:59:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 04:59:17,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:17,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:17,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:17,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-01-14 04:59:17,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:17,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:17,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:59:17,348 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:59:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:59:17,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:59:17,363 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-14 04:59:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:17,371 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-01-14 04:59:17,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:59:17,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-01-14 04:59:17,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-14 04:59:17,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-01-14 04:59:17,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:59:17,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:59:17,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-01-14 04:59:17,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:17,382 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-14 04:59:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-01-14 04:59:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 04:59:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:59:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-01-14 04:59:17,410 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-14 04:59:17,410 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-14 04:59:17,411 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:59:17,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-01-14 04:59:17,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-14 04:59:17,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:17,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:17,412 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:59:17,412 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:17,413 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, 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~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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#L645-2 [2019-01-14 04:59:17,413 INFO L796 eck$LassoCheckResult]: Loop: 53#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 50#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 51#L634-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 52#L634-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; 58#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#L640 assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 61#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 53#L645-2 [2019-01-14 04:59:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 04:59:17,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:17,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:17,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:17,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-01-14 04:59:17,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:17,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:17,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:17,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:59:17,641 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:59:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:59:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:59:17,642 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 04:59:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:18,141 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-01-14 04:59:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:59:18,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-01-14 04:59:18,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 04:59:18,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-01-14 04:59:18,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 04:59:18,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 04:59:18,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-01-14 04:59:18,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:18,148 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-01-14 04:59:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-01-14 04:59:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-01-14 04:59:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 04:59:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-14 04:59:18,152 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 04:59:18,152 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 04:59:18,152 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:59:18,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-14 04:59:18,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-14 04:59:18,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:18,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:18,154 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:59:18,154 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:18,154 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, 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~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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#L645-2 [2019-01-14 04:59:18,154 INFO L796 eck$LassoCheckResult]: Loop: 105#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 101#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 102#L634-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 103#L634-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; 120#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 112#L640 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; 113#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 117#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 105#L645-2 [2019-01-14 04:59:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 04:59:18,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:18,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:18,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-01-14 04:59:18,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:18,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:18,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-01-14 04:59:18,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:18,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:18,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:18,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:18,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:59:18,792 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-01-14 04:59:19,144 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:59:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:59:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:59:19,146 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-14 04:59:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:19,316 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-01-14 04:59:19,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:59:19,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-01-14 04:59:19,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-01-14 04:59:19,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-01-14 04:59:19,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-14 04:59:19,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-14 04:59:19,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-01-14 04:59:19,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:19,324 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-01-14 04:59:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-01-14 04:59:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-01-14 04:59:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 04:59:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-01-14 04:59:19,328 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-01-14 04:59:19,328 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-01-14 04:59:19,328 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:59:19,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-01-14 04:59:19,329 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-01-14 04:59:19,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:19,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:19,330 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:59:19,330 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:19,330 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, 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~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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#L645-2 [2019-01-14 04:59:19,330 INFO L796 eck$LassoCheckResult]: Loop: 171#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 168#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 169#L634-1 assume !main_#t~short4; 170#L634-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; 195#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 194#L640 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; 183#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 184#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 171#L645-2 [2019-01-14 04:59:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-14 04:59:19,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:19,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:19,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-01-14 04:59:19,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:19,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:19,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:19,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-01-14 04:59:19,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:19,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:19,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:19,609 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-01-14 04:59:19,755 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 04:59:19,912 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-01-14 04:59:20,035 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 04:59:20,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:59:20 BoogieIcfgContainer [2019-01-14 04:59:20,104 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:59:20,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:59:20,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:59:20,105 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:59:20,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:17" (3/4) ... [2019-01-14 04:59:20,109 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:59:20,164 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:59:20,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:59:20,165 INFO L168 Benchmark]: Toolchain (without parser) took 4425.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 954.0 MB in the beginning and 905.1 MB in the end (delta: 48.9 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:20,167 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:59:20,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:20,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.24 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-01-14 04:59:20,169 INFO L168 Benchmark]: Boogie Preprocessor took 45.44 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-01-14 04:59:20,170 INFO L168 Benchmark]: RCFGBuilder took 628.20 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.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:20,171 INFO L168 Benchmark]: BuchiAutomizer took 3050.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.1 MB in the end (delta: 158.0 MB). Peak memory consumption was 158.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:20,172 INFO L168 Benchmark]: Witness Printer took 59.75 ms. Allocated memory is still 1.2 GB. Free memory is still 905.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:59:20,178 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 577.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.24 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. * Boogie Preprocessor took 45.44 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 628.20 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.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3050.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.1 MB in the end (delta: 158.0 MB). Peak memory consumption was 158.0 MB. Max. memory is 11.5 GB. * Witness Printer took 59.75 ms. Allocated memory is still 1.2 GB. Free memory is still 905.1 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.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.4s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 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.4s 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: 632]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=-2} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ea53bab=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@59f4cd2e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f59ca40=-1, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@372dfab8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c36232e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ef9b59a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b11f7c7=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@598b6e45=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ea53bab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@378adf9e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@84387ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54fce682=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@598b6e45=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4405e10c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74f310e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@272e9c1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@361678fd=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2bbbf424=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@547e16ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74f310e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1dfb666a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@376f9a08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@376f9a08=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c36232e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@164f6c1d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ef9b59a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bda90dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a5a37da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@361678fd=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bda90dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20181641=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@372dfab8=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@378adf9e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f8774ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ca094f9=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b11f7c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@547e16ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@164f6c1d=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@78e8dbf4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f8774ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@272e9c1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4405e10c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a0fc33a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@84387ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f59ca40=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1dfb666a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a0fc33a=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2bbbf424=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@59f4cd2e=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 632]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) Loop: [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...