./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/memsafety-ext/tree_cnstr_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_cnstr_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 275864fd23c88e3a2867d84f3947ff5231f6c6d6 .............................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:50,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:50,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:50,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:50,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:50,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:50,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:50,968 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:50,970 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:50,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:50,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:50,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:50,973 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:50,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:50,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:50,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:50,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:50,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:50,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:50,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:50,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:50,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:50,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:50,988 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:50,988 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:50,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:50,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:50,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:50,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:50,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:50,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:50,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:50,995 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:50,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:50,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:50,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:50,998 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:51,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:51,016 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:51,017 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:51,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:51,017 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:51,018 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:51,018 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:51,018 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:51,018 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:51,018 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:51,019 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:51,019 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:51,019 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:51,019 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:51,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:51,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:51,020 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:51,020 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:51,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:51,020 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:51,020 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:51,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:51,021 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:51,021 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:51,021 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:51,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:51,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:51,022 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:51,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:51,022 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:51,022 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:51,023 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:51,023 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 -> 275864fd23c88e3a2867d84f3947ff5231f6c6d6 [2018-11-29 00:11:51,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:51,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:51,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:51,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:51,092 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:51,093 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-11-29 00:11:51,172 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15f810c1/01a5d59192e941939c168eab1462a311/FLAGcc911cef1 [2018-11-29 00:11:51,703 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:51,704 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-11-29 00:11:51,717 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15f810c1/01a5d59192e941939c168eab1462a311/FLAGcc911cef1 [2018-11-29 00:11:51,991 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15f810c1/01a5d59192e941939c168eab1462a311 [2018-11-29 00:11:51,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:51,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:52,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:52,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:52,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:52,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:51" (1/1) ... [2018-11-29 00:11:52,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de2ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52, skipping insertion in model container [2018-11-29 00:11:52,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:51" (1/1) ... [2018-11-29 00:11:52,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:52,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:52,527 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:52,537 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:52,598 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:52,669 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:52,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52 WrapperNode [2018-11-29 00:11:52,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:52,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:52,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:52,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:52,751 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:52" (1/1) ... [2018-11-29 00:11:52,781 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:52" (1/1) ... [2018-11-29 00:11:52,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:52,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:52,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:52,820 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:52,833 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:52" (1/1) ... [2018-11-29 00:11:52,833 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:52" (1/1) ... [2018-11-29 00:11:52,837 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:52" (1/1) ... [2018-11-29 00:11:52,837 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:52" (1/1) ... [2018-11-29 00:11:52,846 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:52" (1/1) ... [2018-11-29 00:11:52,852 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:52" (1/1) ... [2018-11-29 00:11:52,854 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:52" (1/1) ... [2018-11-29 00:11:52,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:52,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:52,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:52,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:52,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (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:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-29 00:11:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-29 00:11:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:52,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:53,531 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:53,532 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:53,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:53 BoogieIcfgContainer [2018-11-29 00:11:53,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:53,533 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:53,533 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:53,538 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:53,539 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:53,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:51" (1/3) ... [2018-11-29 00:11:53,541 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c058cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:53, skipping insertion in model container [2018-11-29 00:11:53,541 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:53,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (2/3) ... [2018-11-29 00:11:53,541 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c058cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:53, skipping insertion in model container [2018-11-29 00:11:53,542 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:53,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:53" (3/3) ... [2018-11-29 00:11:53,545 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-11-29 00:11:53,605 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:53,605 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:53,606 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:53,606 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:53,607 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:53,607 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:53,607 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:53,607 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:53,608 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:53,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-29 00:11:53,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-29 00:11:53,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:53,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:53,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:53,657 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:53,658 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:53,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-29 00:11:53,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-29 00:11:53,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:53,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:53,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:53,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:53,671 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(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); 10#L641-2true [2018-11-29 00:11:53,672 INFO L796 eck$LassoCheckResult]: Loop: 10#L641-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; 8#L631-2true assume !true; 23#L630-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 20#L636true 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(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; 26#L636-2true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 6#L641true assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 10#L641-2true [2018-11-29 00:11:53,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-29 00:11:53,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:53,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-11-29 00:11:53,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:53,860 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:53,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:53,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:53,869 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:11:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:11:53,892 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-29 00:11:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:53,908 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2018-11-29 00:11:53,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:11:53,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2018-11-29 00:11:53,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-29 00:11:53,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2018-11-29 00:11:53,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:11:53,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:11:53,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2018-11-29 00:11:53,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:53,925 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-29 00:11:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2018-11-29 00:11:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-29 00:11:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:11:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-11-29 00:11:53,962 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-29 00:11:53,963 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-29 00:11:53,963 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:53,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-11-29 00:11:53,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-29 00:11:53,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:53,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:53,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:53,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:53,968 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(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); 62#L641-2 [2018-11-29 00:11:53,968 INFO L796 eck$LassoCheckResult]: Loop: 62#L641-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; 59#L631-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; 64#L630-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; 65#L630-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; 72#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 74#L636 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(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; 75#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 61#L641 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 62#L641-2 [2018-11-29 00:11:53,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-29 00:11:53,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:53,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-11-29 00:11:53,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:53,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:53,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:54,250 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:54,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:54,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:11:54,251 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:11:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:11:54,252 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-29 00:11:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:54,556 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2018-11-29 00:11:54,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:11:54,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2018-11-29 00:11:54,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-29 00:11:54,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2018-11-29 00:11:54,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-29 00:11:54,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-29 00:11:54,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2018-11-29 00:11:54,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:54,564 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2018-11-29 00:11:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2018-11-29 00:11:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-29 00:11:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:11:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-29 00:11:54,568 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-29 00:11:54,568 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-29 00:11:54,568 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:54,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2018-11-29 00:11:54,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:11:54,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:54,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:54,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:54,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:54,571 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(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); 119#L641-2 [2018-11-29 00:11:54,571 INFO L796 eck$LassoCheckResult]: Loop: 119#L641-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; 116#L631-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; 121#L630-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; 122#L630-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; 134#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L636 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; 133#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 118#L641 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 119#L641-2 [2018-11-29 00:11:54,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-29 00:11:54,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:54,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:54,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:54,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-11-29 00:11:54,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:54,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:54,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:54,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-11-29 00:11:54,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:54,765 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:54,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:54,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:11:55,262 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-29 00:11:55,637 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:11:55,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:11:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:11:55,638 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-29 00:11:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:55,898 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2018-11-29 00:11:55,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:11:55,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2018-11-29 00:11:55,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2018-11-29 00:11:55,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2018-11-29 00:11:55,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-29 00:11:55,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-29 00:11:55,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2018-11-29 00:11:55,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:55,908 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2018-11-29 00:11:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2018-11-29 00:11:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2018-11-29 00:11:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-29 00:11:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-11-29 00:11:55,913 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-29 00:11:55,913 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-29 00:11:55,913 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:55,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-11-29 00:11:55,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2018-11-29 00:11:55,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:55,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:55,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:11:55,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:55,915 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(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); 215#L641-2 [2018-11-29 00:11:55,915 INFO L796 eck$LassoCheckResult]: Loop: 215#L641-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; 212#L631-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; 213#L630-1 assume !main_#t~short4; 214#L630-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; 234#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L636 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; 228#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 229#L641 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 215#L641-2 [2018-11-29 00:11:55,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-29 00:11:55,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:55,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:55,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:55,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:55,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:55,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-11-29 00:11:55,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:55,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:55,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:55,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-11-29 00:11:55,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,187 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-11-29 00:11:56,385 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-29 00:11:56,521 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-29 00:11:56,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:56 BoogieIcfgContainer [2018-11-29 00:11:56,628 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:56,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:56,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:56,629 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:56,630 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:53" (3/4) ... [2018-11-29 00:11:56,639 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:11:56,715 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:11:56,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:56,717 INFO L168 Benchmark]: Toolchain (without parser) took 4720.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 934.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:56,718 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:56,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.42 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:56,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -212.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:56,721 INFO L168 Benchmark]: Boogie Preprocessor took 36.91 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. [2018-11-29 00:11:56,725 INFO L168 Benchmark]: RCFGBuilder took 675.17 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:56,726 INFO L168 Benchmark]: BuchiAutomizer took 3095.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.6 MB in the end (delta: 166.6 MB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:56,727 INFO L168 Benchmark]: Witness Printer took 86.86 ms. Allocated memory is still 1.2 GB. Free memory was 940.6 MB in the beginning and 934.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:56,733 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 668.42 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 149.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -212.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.91 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 675.17 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3095.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.6 MB in the end (delta: 166.6 MB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. * Witness Printer took 86.86 ms. Allocated memory is still 1.2 GB. Free memory was 940.6 MB in the beginning and 934.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. 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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.3s. 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, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 55 SDslu, 69 SDs, 0 SdLazy, 134 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 628]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@143922b8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f1040df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64ec35c6=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6284e7f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c306477=0, root=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c8b2b3d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@20cb4d75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@143922b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@21372313=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67b9d01e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@20cb4d75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c2dfeb2=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c8b2b3d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e990821=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c12f0da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@496c79b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c2dfeb2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48800455=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f6214ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f6214ee=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@178b7ee0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e9cc490=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bae4a21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f1f81e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e990821=0, n=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bae4a21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7973ca21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6284e7f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@21372313=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c4d833b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c24db36=17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c306477=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7cac6d22=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@496c79b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@178b7ee0=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e9cc490=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@47d8c089=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c4d833b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23ae6454=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64ec35c6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48800455=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23ae6454=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c12f0da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f1040df=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 628]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] root->left = ((void *)0) [L627] root->right = ((void *)0) Loop: [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR n->left [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR n->right [L641] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...