./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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_parent_ptr_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 b677e0cdf35fdc8eada9522ef5e29b8173f39a0f ................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-91b1670 [2018-11-29 00:11:53,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:53,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:53,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:53,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:53,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:53,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:53,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:53,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:53,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:53,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:53,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:53,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:53,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:53,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:53,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:53,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:53,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:53,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:53,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:53,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:53,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:53,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:53,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:53,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:53,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:53,872 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:53,872 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:53,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:53,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:53,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:53,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:53,877 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:53,877 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:53,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:53,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:53,880 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:53,904 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:53,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:53,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:53,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:53,909 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:53,909 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:53,910 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:53,910 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:53,910 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:53,910 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:53,910 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:53,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:53,911 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:53,911 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:53,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:53,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:53,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:53,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:53,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:53,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:53,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:53,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:53,916 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:53,916 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:53,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:53,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:53,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:53,916 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:53,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:53,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:53,920 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:53,921 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:53,922 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 -> b677e0cdf35fdc8eada9522ef5e29b8173f39a0f [2018-11-29 00:11:53,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:53,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:54,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:54,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:54,005 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:54,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-11-29 00:11:54,065 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f648393d/48904a2285084801a57610fb61416bd6/FLAGa09c185ab [2018-11-29 00:11:54,587 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:54,588 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-11-29 00:11:54,601 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f648393d/48904a2285084801a57610fb61416bd6/FLAGa09c185ab [2018-11-29 00:11:54,874 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f648393d/48904a2285084801a57610fb61416bd6 [2018-11-29 00:11:54,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:54,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:54,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:54,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:54,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:54,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:54" (1/1) ... [2018-11-29 00:11:54,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56eb6954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:54, skipping insertion in model container [2018-11-29 00:11:54,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:54" (1/1) ... [2018-11-29 00:11:54,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:54,964 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:55,382 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:55,400 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:55,469 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:55,536 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:55,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55 WrapperNode [2018-11-29 00:11:55,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:55,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:55,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:55,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:55,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:55,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:55,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:55,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:55,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (1/1) ... [2018-11-29 00:11:55,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:55,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:55,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:55,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:55,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (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 [2018-11-29 00:11:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-29 00:11:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-29 00:11:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:55,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:56,452 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:56,452 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-29 00:11:56,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:56 BoogieIcfgContainer [2018-11-29 00:11:56,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:56,454 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:56,454 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:56,463 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:56,465 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:56,465 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:54" (1/3) ... [2018-11-29 00:11:56,466 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47e1fe1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:56, skipping insertion in model container [2018-11-29 00:11:56,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:56,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:55" (2/3) ... [2018-11-29 00:11:56,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47e1fe1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:56, skipping insertion in model container [2018-11-29 00:11:56,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:56,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:56" (3/3) ... [2018-11-29 00:11:56,470 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-11-29 00:11:56,536 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:56,537 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:56,537 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:56,537 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:56,537 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:56,537 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:56,537 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:56,537 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:56,538 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:56,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-29 00:11:56,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-29 00:11:56,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:56,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:56,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:56,583 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:56,583 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:56,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-29 00:11:56,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-29 00:11:56,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:56,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:56,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:56,586 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:56,596 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 18#L648-2true [2018-11-29 00:11:56,597 INFO L796 eck$LassoCheckResult]: Loop: 18#L648-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; 20#L637-2true assume !true; 7#L636-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L642true assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(12);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;call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem13.base, 8 + main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset; 9#L642-2true call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 13#L648true assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~nondet15; 18#L648-2true [2018-11-29 00:11:56,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-29 00:11:56,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:56,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:56,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-11-29 00:11:56,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:56,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:56,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:56,820 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:11:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:11:56,841 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-29 00:11:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:56,850 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2018-11-29 00:11:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:11:56,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2018-11-29 00:11:56,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-29 00:11:56,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2018-11-29 00:11:56,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:11:56,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:11:56,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2018-11-29 00:11:56,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:56,863 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-29 00:11:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2018-11-29 00:11:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-29 00:11:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:11:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-11-29 00:11:56,896 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-29 00:11:56,896 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-29 00:11:56,896 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:56,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2018-11-29 00:11:56,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-29 00:11:56,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:56,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:56,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:56,899 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:56,899 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#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~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 62#L648-2 [2018-11-29 00:11:56,899 INFO L796 eck$LassoCheckResult]: Loop: 62#L648-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; 65#L637-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; 66#L636-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; 50#L636-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset; 51#L636-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 57#L642 assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(12);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;call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem13.base, 8 + main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset; 58#L642-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 60#L648 assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~nondet15; 62#L648-2 [2018-11-29 00:11:56,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-29 00:11:56,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:56,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:56,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-11-29 00:11:56,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:56,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:56,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:57,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:57,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:11:57,207 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:11:57,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:11:57,209 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-29 00:11:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:57,691 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2018-11-29 00:11:57,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:11:57,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2018-11-29 00:11:57,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:11:57,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2018-11-29 00:11:57,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-29 00:11:57,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-29 00:11:57,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2018-11-29 00:11:57,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:57,699 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-11-29 00:11:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2018-11-29 00:11:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-29 00:11:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:11:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-29 00:11:57,705 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-29 00:11:57,705 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-29 00:11:57,705 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:57,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-29 00:11:57,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-29 00:11:57,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:57,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:57,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:57,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:57,709 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 114#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~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 115#L648-2 [2018-11-29 00:11:57,709 INFO L796 eck$LassoCheckResult]: Loop: 115#L648-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; 118#L637-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; 119#L636-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; 101#L636-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset; 102#L636-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 108#L642 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 109#L642-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 113#L648 assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~nondet15; 115#L648-2 [2018-11-29 00:11:57,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-29 00:11:57,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:57,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:57,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-11-29 00:11:57,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:57,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:57,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-11-29 00:11:57,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:57,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:57,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:11:58,468 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-29 00:11:58,777 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:11:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:11:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:11:58,779 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-29 00:11:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:58,997 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-11-29 00:11:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:11:59,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2018-11-29 00:11:59,001 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-29 00:11:59,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2018-11-29 00:11:59,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-29 00:11:59,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-29 00:11:59,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2018-11-29 00:11:59,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:59,004 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2018-11-29 00:11:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2018-11-29 00:11:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-11-29 00:11:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-29 00:11:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-11-29 00:11:59,008 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-29 00:11:59,008 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-29 00:11:59,008 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:59,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2018-11-29 00:11:59,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-29 00:11:59,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:59,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:59,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:59,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:59,011 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#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~mem14.base, main_#t~mem14.offset, main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet1, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 181#L648-2 [2018-11-29 00:11:59,011 INFO L796 eck$LassoCheckResult]: Loop: 181#L648-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; 192#L637-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; 189#L636-1 assume !main_#t~short4; 190#L636-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset; 195#L636-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L642 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 178#L642-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 179#L648 assume !((main_#t~mem14.base == 0 && main_#t~mem14.offset == 0) && 0 != main_#t~nondet15);havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~nondet15; 181#L648-2 [2018-11-29 00:11:59,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:59,011 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-29 00:11:59,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:59,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-11-29 00:11:59,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:59,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:59,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:59,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-11-29 00:11:59,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:59,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,350 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-11-29 00:11:59,504 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-29 00:11:59,677 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-11-29 00:11:59,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:59 BoogieIcfgContainer [2018-11-29 00:11:59,782 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:59,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:59,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:59,784 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:59,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:56" (3/4) ... [2018-11-29 00:11:59,789 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:11:59,860 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:11:59,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:59,862 INFO L168 Benchmark]: Toolchain (without parser) took 4983.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 952.7 MB in the beginning and 862.0 MB in the end (delta: 90.7 MB). Peak memory consumption was 161.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:59,863 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. [2018-11-29 00:11:59,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.71 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:59,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:59,868 INFO L168 Benchmark]: Boogie Preprocessor took 53.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:59,869 INFO L168 Benchmark]: RCFGBuilder took 711.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:59,871 INFO L168 Benchmark]: BuchiAutomizer took 3328.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 862.0 MB in the end (delta: 162.4 MB). Peak memory consumption was 162.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:59,873 INFO L168 Benchmark]: Witness Printer took 78.12 ms. Allocated memory is still 1.1 GB. Free memory is still 862.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:59,880 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 656.71 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 148.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 711.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3328.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 862.0 MB in the end (delta: 162.4 MB). Peak memory consumption was 162.4 MB. Max. memory is 11.5 GB. * Witness Printer took 78.12 ms. Allocated memory is still 1.1 GB. Free memory is still 862.0 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.3s. 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: 634]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68a805d7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31170ce3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26d9595f=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@699632c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e322e82=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17ed3ebe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79273ebc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@256157b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67c88ae2=0, root=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36a9d7f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68a805d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@295656a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55f0edc6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79273ebc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36a9d7f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67c88ae2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@699632c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b3157c7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@620b45ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@783a60c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cea2bd9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@954cbeb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c6c9ff9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c6c9ff9=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f5ef28e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17ed3ebe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b99c18f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29a2c788=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@766a5603=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b3157c7=0, n=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29a2c788=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c8a67ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e322e82=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@620b45ee=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@714c8832=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d092cea=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@256157b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cea2bd9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f5ef28e=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b99c18f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1a64c1f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@714c8832=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13a5ad79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51b86db5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38977d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38977d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26d9595f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55f0edc6=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@954cbeb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51b86db5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13a5ad79=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@783a60c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31170ce3=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 634]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] root->left = ((void *)0) [L632] root->right = ((void *)0) [L633] root->parent = ((void *)0) Loop: [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR n->left [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR n->right [L648] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...