./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_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 eed6d14b3659ee573ecc9a025ea4a6cd48efa35c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:39:04,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:39:04,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:39:04,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:39:04,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:39:04,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:39:04,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:39:04,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:39:04,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:39:04,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:39:04,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:39:04,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:39:04,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:39:04,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:39:04,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:39:04,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:39:04,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:39:04,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:39:04,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:39:04,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:39:04,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:39:04,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:39:04,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:39:04,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:39:04,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:39:04,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:39:04,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:39:04,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:39:04,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:39:04,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:39:04,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:39:04,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:39:04,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:39:04,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:39:04,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:39:04,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:39:04,305 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:39:04,326 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:39:04,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:39:04,327 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:39:04,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:39:04,328 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:39:04,328 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:39:04,328 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:39:04,328 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:39:04,329 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:39:04,329 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:39:04,329 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:39:04,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:39:04,329 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:39:04,329 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:39:04,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:39:04,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:39:04,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:39:04,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:39:04,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:39:04,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:39:04,331 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:39:04,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:39:04,331 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:39:04,331 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:39:04,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:39:04,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:39:04,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:39:04,332 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:39:04,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:39:04,332 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:39:04,332 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:39:04,333 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:39:04,334 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 -> eed6d14b3659ee573ecc9a025ea4a6cd48efa35c [2019-01-14 03:39:04,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:39:04,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:39:04,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:39:04,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:39:04,393 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:39:04,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2019-01-14 03:39:04,466 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339dd509c/be3659a6c63841f488dfe3d76302a04e/FLAG6c4c99292 [2019-01-14 03:39:05,094 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:39:05,095 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2019-01-14 03:39:05,120 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339dd509c/be3659a6c63841f488dfe3d76302a04e/FLAG6c4c99292 [2019-01-14 03:39:05,318 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339dd509c/be3659a6c63841f488dfe3d76302a04e [2019-01-14 03:39:05,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:39:05,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:39:05,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:05,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:39:05,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:39:05,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:05" (1/1) ... [2019-01-14 03:39:05,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1271ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:05, skipping insertion in model container [2019-01-14 03:39:05,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:05" (1/1) ... [2019-01-14 03:39:05,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:39:05,394 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:39:05,792 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:05,821 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:39:05,973 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:06,041 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:39:06,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06 WrapperNode [2019-01-14 03:39:06,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:06,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:06,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:39:06,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:39:06,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:06,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:39:06,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:39:06,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:39:06,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... [2019-01-14 03:39:06,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:39:06,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:39:06,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:39:06,159 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:39:06,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:39:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 03:39:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 03:39:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 03:39:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 03:39:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 03:39:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 03:39:06,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:39:06,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:39:07,146 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:39:07,146 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-14 03:39:07,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:07 BoogieIcfgContainer [2019-01-14 03:39:07,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:39:07,149 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:39:07,149 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:39:07,153 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:39:07,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:07,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:39:05" (1/3) ... [2019-01-14 03:39:07,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dc34487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:07, skipping insertion in model container [2019-01-14 03:39:07,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:07,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:06" (2/3) ... [2019-01-14 03:39:07,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dc34487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:07, skipping insertion in model container [2019-01-14 03:39:07,157 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:07,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:07" (3/3) ... [2019-01-14 03:39:07,159 INFO L375 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2019-01-14 03:39:07,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:39:07,224 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:39:07,224 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:39:07,225 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:39:07,225 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:39:07,225 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:39:07,225 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:39:07,225 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:39:07,225 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:39:07,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-14 03:39:07,275 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-01-14 03:39:07,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:07,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:07,285 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:07,285 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:39:07,285 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:39:07,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-14 03:39:07,289 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-01-14 03:39:07,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:07,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:07,290 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:07,290 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:39:07,299 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 8#L557-2true [2019-01-14 03:39:07,300 INFO L796 eck$LassoCheckResult]: Loop: 8#L557-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 30#L547-2true assume !true; 40#L546-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 17#L552true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 23#L552-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 4#L557true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 8#L557-2true [2019-01-14 03:39:07,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:07,307 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:39:07,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-01-14 03:39:07,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:07,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:07,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:39:07,515 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:39:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 03:39:07,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 03:39:07,536 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-01-14 03:39:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:07,548 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2019-01-14 03:39:07,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:39:07,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2019-01-14 03:39:07,560 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-01-14 03:39:07,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2019-01-14 03:39:07,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 03:39:07,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-14 03:39:07,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2019-01-14 03:39:07,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:07,574 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-01-14 03:39:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2019-01-14 03:39:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-14 03:39:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 03:39:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-01-14 03:39:07,623 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-01-14 03:39:07,623 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-01-14 03:39:07,623 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:39:07,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2019-01-14 03:39:07,625 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-01-14 03:39:07,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:07,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:07,629 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:07,630 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:07,630 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 114#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 99#L557-2 [2019-01-14 03:39:07,630 INFO L796 eck$LassoCheckResult]: Loop: 99#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 104#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 101#L546-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 102#L546-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 112#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 119#L552 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 120#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 98#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 99#L557-2 [2019-01-14 03:39:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 03:39:07,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:07,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-01-14 03:39:07,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:07,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:07,929 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 03:39:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:07,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:07,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:39:07,998 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:39:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:39:07,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:39:07,999 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-01-14 03:39:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:08,542 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2019-01-14 03:39:08,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:39:08,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2019-01-14 03:39:08,549 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2019-01-14 03:39:08,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2019-01-14 03:39:08,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-14 03:39:08,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-14 03:39:08,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2019-01-14 03:39:08,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:08,558 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-01-14 03:39:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2019-01-14 03:39:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-01-14 03:39:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 03:39:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-01-14 03:39:08,570 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-01-14 03:39:08,570 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-01-14 03:39:08,570 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:39:08,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2019-01-14 03:39:08,574 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2019-01-14 03:39:08,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:08,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:08,575 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:08,576 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:08,577 INFO L794 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 206#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 190#L557-2 [2019-01-14 03:39:08,577 INFO L796 eck$LassoCheckResult]: Loop: 190#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 196#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 192#L546-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 193#L546-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 226#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 211#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 212#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 189#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 190#L557-2 [2019-01-14 03:39:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 03:39:08,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:08,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:08,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-01-14 03:39:08,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:08,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:08,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-01-14 03:39:08,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:08,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:08,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:08,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:08,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:08,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:08,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:39:09,427 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-01-14 03:39:09,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:39:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:39:09,548 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2019-01-14 03:39:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:10,042 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2019-01-14 03:39:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:39:10,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2019-01-14 03:39:10,047 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2019-01-14 03:39:10,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2019-01-14 03:39:10,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-01-14 03:39:10,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-01-14 03:39:10,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2019-01-14 03:39:10,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:10,052 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-01-14 03:39:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2019-01-14 03:39:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-14 03:39:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 03:39:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2019-01-14 03:39:10,058 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-01-14 03:39:10,059 INFO L609 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-01-14 03:39:10,059 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:39:10,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2019-01-14 03:39:10,061 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2019-01-14 03:39:10,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:10,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:10,062 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:10,062 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:10,062 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 351#L557-2 [2019-01-14 03:39:10,062 INFO L796 eck$LassoCheckResult]: Loop: 351#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 366#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 338#L546-1 assume !main_#t~short6; 339#L546-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 349#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 379#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 359#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 360#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 351#L557-2 [2019-01-14 03:39:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-14 03:39:10,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:10,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:10,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-01-14 03:39:10,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:10,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:10,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-01-14 03:39:10,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:10,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:10,490 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-01-14 03:39:10,626 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 03:39:10,829 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-14 03:39:10,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:39:10,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:39:10,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:39:10,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:119, output treesize:107 [2019-01-14 03:39:11,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:39:11 BoogieIcfgContainer [2019-01-14 03:39:11,059 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:39:11,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:39:11,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:39:11,060 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:39:11,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:07" (3/4) ... [2019-01-14 03:39:11,067 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 03:39:11,149 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 03:39:11,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:39:11,152 INFO L168 Benchmark]: Toolchain (without parser) took 5829.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 952.7 MB in the beginning and 857.3 MB in the end (delta: 95.4 MB). Peak memory consumption was 210.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:11,159 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:39:11,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:11,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.36 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. [2019-01-14 03:39:11,165 INFO L168 Benchmark]: Boogie Preprocessor took 42.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:11,166 INFO L168 Benchmark]: RCFGBuilder took 989.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:11,167 INFO L168 Benchmark]: BuchiAutomizer took 3910.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 864.1 MB in the end (delta: 191.8 MB). Peak memory consumption was 191.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:11,174 INFO L168 Benchmark]: Witness Printer took 89.96 ms. Allocated memory is still 1.1 GB. Free memory was 864.1 MB in the beginning and 857.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:11,186 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 717.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.36 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. * Boogie Preprocessor took 42.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 989.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3910.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 864.1 MB in the end (delta: 191.8 MB). Peak memory consumption was 191.8 MB. Max. memory is 11.5 GB. * Witness Printer took 89.96 ms. Allocated memory is still 1.1 GB. Free memory was 864.1 MB in the beginning and 857.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.8s. 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, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 166 SDtfs, 71 SDslu, 179 SDs, 0 SdLazy, 191 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s 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: 544]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7521} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ee9a750=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@8d1e655=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ebf7f44=0, NULL=7521, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bdd86c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dcf36c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66b6de17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fda08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c99781=0, root=7522, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@122f2c64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ee9a750=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dc8d03a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@642aeafa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@539b1d73=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1dfb3bcb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6927b032=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f855130=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@122f2c64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@642aeafa=7522, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@539b1d73=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@456bb1fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c99781=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@591c6ccc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@264487d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ebf7f44=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@679edbcd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1706af2c=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dcf36c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e5adfa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@456bb1fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66b6de17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f855130=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c779118=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bbf13e2=0, n=7522, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28ee4216=28, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e209f72=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@285f87b2=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c85ae3c=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@264487d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@591c6ccc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f299a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bdd86c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fda08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60cf2cad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e5adfa=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@436d9e0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@680a2b8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c779118=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60cf2cad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f299a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bed64ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67f7e4c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@26323e10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@53aa8af5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c85ae3c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e8a7e7d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@8d1e655=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@679edbcd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1706af2c=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bed64ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@680a2b8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e8a7e7d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@242e661c=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6927b032=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 544]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) Loop: [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...