./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 2e94e6aa 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-2e94e6a [2019-01-02 00:21:30,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:21:30,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:21:30,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:21:30,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:21:30,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:21:30,869 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:21:30,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:21:30,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:21:30,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:21:30,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:21:30,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:21:30,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:21:30,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:21:30,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:21:30,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:21:30,880 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:21:30,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:21:30,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:21:30,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:21:30,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:21:30,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:21:30,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:21:30,892 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:21:30,892 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:21:30,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:21:30,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:21:30,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:21:30,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:21:30,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:21:30,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:21:30,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:21:30,899 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:21:30,899 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:21:30,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:21:30,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:21:30,901 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:21:30,919 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:21:30,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:21:30,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:21:30,925 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:21:30,925 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:21:30,925 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:21:30,925 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:21:30,926 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:21:30,926 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:21:30,926 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:21:30,927 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:21:30,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:21:30,927 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:21:30,927 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:21:30,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:21:30,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:21:30,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:21:30,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:21:30,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:21:30,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:21:30,928 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:21:30,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:21:30,930 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:21:30,930 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:21:30,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:21:30,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:21:30,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:21:30,931 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:21:30,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:21:30,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:21:30,932 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:21:30,934 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:21:30,935 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-02 00:21:30,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:21:31,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:21:31,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:21:31,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:21:31,013 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:21:31,014 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-02 00:21:31,088 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce3a67b3/39c4fc93a7a845598ec1368465bcba70/FLAGaf7a53157 [2019-01-02 00:21:31,605 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:21:31,606 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2019-01-02 00:21:31,626 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce3a67b3/39c4fc93a7a845598ec1368465bcba70/FLAGaf7a53157 [2019-01-02 00:21:31,898 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce3a67b3/39c4fc93a7a845598ec1368465bcba70 [2019-01-02 00:21:31,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:21:31,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:21:31,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:31,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:21:31,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:21:31,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:31" (1/1) ... [2019-01-02 00:21:31,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd9b2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:31, skipping insertion in model container [2019-01-02 00:21:31,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:31" (1/1) ... [2019-01-02 00:21:31,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:21:31,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:21:32,403 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:32,422 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:21:32,580 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:32,631 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:21:32,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32 WrapperNode [2019-01-02 00:21:32,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:32,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:32,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:21:32,633 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:21:32,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:32,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:21:32,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:21:32,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:21:32,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (1/1) ... [2019-01-02 00:21:32,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:21:32,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:21:32,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:21:32,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:21:32,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (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-02 00:21:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-02 00:21:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-02 00:21:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-02 00:21:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:21:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:21:32,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:21:33,368 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:21:33,369 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-02 00:21:33,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:33 BoogieIcfgContainer [2019-01-02 00:21:33,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:21:33,371 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:21:33,371 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:21:33,375 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:21:33,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:33,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:21:31" (1/3) ... [2019-01-02 00:21:33,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51631106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:33, skipping insertion in model container [2019-01-02 00:21:33,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:33,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:32" (2/3) ... [2019-01-02 00:21:33,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51631106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:33, skipping insertion in model container [2019-01-02 00:21:33,379 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:33,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:33" (3/3) ... [2019-01-02 00:21:33,381 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2019-01-02 00:21:33,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:21:33,452 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:21:33,452 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:21:33,452 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:21:33,452 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:21:33,452 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:21:33,452 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:21:33,453 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:21:33,453 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:21:33,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-02 00:21:33,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-02 00:21:33,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:33,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:33,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:21:33,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:21:33,503 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:21:33,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-02 00:21:33,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-02 00:21:33,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:33,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:33,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:21:33,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:21:33,516 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-02 00:21:33,517 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 5#L645-2true [2019-01-02 00:21:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-02 00:21:33,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:33,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-01-02 00:21:33,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:33,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:33,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:33,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:33,706 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-02 00:21:33,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:21:33,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:21:33,714 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:21:33,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:21:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:21:33,732 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-02 00:21:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:33,739 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-01-02 00:21:33,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:21:33,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-01-02 00:21:33,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-02 00:21:33,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-01-02 00:21:33,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-02 00:21:33,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-02 00:21:33,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-01-02 00:21:33,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:33,753 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-02 00:21:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-01-02 00:21:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-02 00:21:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:21:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-01-02 00:21:33,785 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-02 00:21:33,785 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-02 00:21:33,785 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:21:33,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-01-02 00:21:33,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-01-02 00:21:33,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:33,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:33,787 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:21:33,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:33,788 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-02 00:21:33,788 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~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 53#L645-2 [2019-01-02 00:21:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-02 00:21:33,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:33,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:33,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-01-02 00:21:33,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:33,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:34,135 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-02 00:21:34,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:21:34,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:21:34,136 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:21:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:21:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:21:34,137 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-02 00:21:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:34,613 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-01-02 00:21:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:21:34,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-01-02 00:21:34,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-02 00:21:34,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-01-02 00:21:34,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-02 00:21:34,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-02 00:21:34,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-01-02 00:21:34,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:34,620 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-01-02 00:21:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-01-02 00:21:34,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-01-02 00:21:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-02 00:21:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-02 00:21:34,625 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-02 00:21:34,625 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-02 00:21:34,625 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:21:34,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-02 00:21:34,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-02 00:21:34,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:34,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:34,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:21:34,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:34,628 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-02 00:21:34,629 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~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 105#L645-2 [2019-01-02 00:21:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-02 00:21:34,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:34,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-01-02 00:21:34,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:34,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:34,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:34,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:34,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-01-02 00:21:34,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:34,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:34,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:34,842 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-02 00:21:34,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:21:34,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:21:35,375 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-01-02 00:21:35,718 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:21:35,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:21:35,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:21:35,720 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-02 00:21:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:35,907 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-01-02 00:21:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-02 00:21:35,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-01-02 00:21:35,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-01-02 00:21:35,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-01-02 00:21:35,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-02 00:21:35,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-02 00:21:35,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-01-02 00:21:35,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:35,914 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-01-02 00:21:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-01-02 00:21:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-01-02 00:21:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-02 00:21:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-01-02 00:21:35,919 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-01-02 00:21:35,919 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-01-02 00:21:35,919 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:21:35,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-01-02 00:21:35,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-01-02 00:21:35,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:35,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:35,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:21:35,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:35,922 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-02 00:21:35,922 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~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 171#L645-2 [2019-01-02 00:21:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-02 00:21:35,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:35,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:35,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:35,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:35,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:35,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:35,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-01-02 00:21:35,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:35,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:35,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:35,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:35,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-01-02 00:21:35,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:35,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:35,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:36,212 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-01-02 00:21:36,370 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-02 00:21:36,551 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-01-02 00:21:36,691 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-02 00:21:36,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:21:36 BoogieIcfgContainer [2019-01-02 00:21:36,745 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:21:36,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:21:36,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:21:36,746 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:21:36,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:33" (3/4) ... [2019-01-02 00:21:36,752 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-02 00:21:36,835 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-02 00:21:36,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:21:36,839 INFO L168 Benchmark]: Toolchain (without parser) took 4936.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 954.0 MB in the beginning and 924.4 MB in the end (delta: 29.6 MB). Peak memory consumption was 164.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:36,840 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-02 00:21:36,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:36,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.22 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-02 00:21:36,847 INFO L168 Benchmark]: Boogie Preprocessor took 60.45 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-02 00:21:36,851 INFO L168 Benchmark]: RCFGBuilder took 615.00 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.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:36,852 INFO L168 Benchmark]: BuchiAutomizer took 3374.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.4 MB in the end (delta: 157.5 MB). Peak memory consumption was 157.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:36,853 INFO L168 Benchmark]: Witness Printer took 92.63 ms. Allocated memory is still 1.2 GB. Free memory is still 924.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:36,864 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 726.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.22 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 60.45 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 615.00 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.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3374.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.4 MB in the end (delta: 157.5 MB). Peak memory consumption was 157.5 MB. Max. memory is 11.5 GB. * Witness Printer took 92.63 ms. Allocated memory is still 1.2 GB. Free memory is still 924.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. 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@2a0b7586=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6acfa4da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c9e03e6=-1, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1787d1bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a1688e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60103bfc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50c83271=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23a670b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a0b7586=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15be50c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e553a54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39cb3332=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23a670b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bd414c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@473f74ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b8c8d51=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c04a56d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18f4ec06=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@352e686c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@473f74ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@124bd45d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4feae009=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4feae009=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a1688e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a1916f2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60103bfc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@145572f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@159a3fcb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c04a56d=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@145572f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69114312=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1787d1bb=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15be50c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@472792a8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50db4fc2=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50c83271=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@352e686c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a1916f2=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4033e4b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@472792a8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b8c8d51=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bd414c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39ac0dd6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e553a54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c9e03e6=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@124bd45d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39ac0dd6=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18f4ec06=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6acfa4da=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...