./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.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.25-8bd4bc6 [2020-07-29 02:04:33,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:04:33,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:04:33,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:04:33,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:04:33,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:04:33,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:04:33,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:04:33,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:04:33,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:04:33,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:04:33,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:04:33,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:04:33,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:04:33,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:04:33,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:04:33,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:04:33,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:04:33,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:04:33,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:04:33,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:04:33,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:04:33,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:04:33,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:04:33,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:04:33,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:04:33,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:04:33,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:04:33,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:04:33,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:04:33,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:04:33,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:04:33,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:04:33,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:04:33,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:04:33,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:04:33,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:04:33,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:04:33,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:04:33,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:04:33,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:04:33,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:04:33,336 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:04:33,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:04:33,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:04:33,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:04:33,338 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:04:33,338 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:04:33,338 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:04:33,339 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:04:33,339 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:04:33,339 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:04:33,339 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:04:33,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:04:33,339 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:04:33,340 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:04:33,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:04:33,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:04:33,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:04:33,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:04:33,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:04:33,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:04:33,343 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:04:33,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:04:33,344 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:04:33,344 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:04:33,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:04:33,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:04:33,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:04:33,345 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:04:33,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:04:33,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:04:33,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:04:33,347 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:04:33,349 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:04:33,349 INFO L138 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 [2020-07-29 02:04:33,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:04:33,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:04:33,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:04:33,682 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:04:33,685 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:04:33,686 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-29 02:04:33,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bd3325a/6a3487f61f66499a9e2c3cfd59829edb/FLAG34b921cbb [2020-07-29 02:04:34,248 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:04:34,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-29 02:04:34,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bd3325a/6a3487f61f66499a9e2c3cfd59829edb/FLAG34b921cbb [2020-07-29 02:04:34,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bd3325a/6a3487f61f66499a9e2c3cfd59829edb [2020-07-29 02:04:34,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:04:34,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:04:34,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:04:34,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:04:34,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:04:34,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:04:34" (1/1) ... [2020-07-29 02:04:34,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343e4e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:34, skipping insertion in model container [2020-07-29 02:04:34,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:04:34" (1/1) ... [2020-07-29 02:04:34,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:04:34,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:04:35,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:04:35,048 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:04:35,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:04:35,174 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:04:35,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35 WrapperNode [2020-07-29 02:04:35,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:04:35,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:04:35,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:04:35,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:04:35,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:04:35,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:04:35,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:04:35,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:04:35,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (1/1) ... [2020-07-29 02:04:35,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:04:35,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:04:35,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:04:35,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:04:35,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (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 [2020-07-29 02:04:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 02:04:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 02:04:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 02:04:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 02:04:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 02:04:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 02:04:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:04:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:04:36,385 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:04:36,386 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-29 02:04:36,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:04:36 BoogieIcfgContainer [2020-07-29 02:04:36,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:04:36,391 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:04:36,392 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:04:36,396 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:04:36,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:04:36,397 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:04:34" (1/3) ... [2020-07-29 02:04:36,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37dac696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:04:36, skipping insertion in model container [2020-07-29 02:04:36,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:04:36,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:04:35" (2/3) ... [2020-07-29 02:04:36,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37dac696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:04:36, skipping insertion in model container [2020-07-29 02:04:36,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:04:36,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:04:36" (3/3) ... [2020-07-29 02:04:36,402 INFO L371 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-07-29 02:04:36,456 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:04:36,456 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:04:36,457 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:04:36,457 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:04:36,457 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:04:36,458 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:04:36,458 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:04:36,458 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:04:36,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-29 02:04:36,507 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-07-29 02:04:36,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:04:36,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:04:36,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:04:36,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 02:04:36,516 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:04:36,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-29 02:04:36,524 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-07-29 02:04:36,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:04:36,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:04:36,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:04:36,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 02:04:36,533 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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 [2020-07-29 02:04:36,533 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~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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 [2020-07-29 02:04:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 02:04:36,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:36,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848576288] [2020-07-29 02:04:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:36,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:36,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:36,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:04:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-07-29 02:04:36,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:36,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146256125] [2020-07-29 02:04:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:04:36,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} 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; {50#true} is VALID [2020-07-29 02:04:36,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} assume !true; {51#false} is VALID [2020-07-29 02:04:36,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {51#false} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {51#false} is VALID [2020-07-29 02:04:36,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#false} assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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; {51#false} is VALID [2020-07-29 02:04:36,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {51#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {51#false} is VALID [2020-07-29 02:04:36,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {51#false} 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; {51#false} is VALID [2020-07-29 02:04:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:04:36,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146256125] [2020-07-29 02:04:36,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:04:36,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 02:04:36,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478851036] [2020-07-29 02:04:36,749 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 02:04:36,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:04:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 02:04:36,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 02:04:36,768 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2020-07-29 02:04:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:36,869 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2020-07-29 02:04:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:04:36,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 02:04:36,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:04:36,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2020-07-29 02:04:36,901 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-07-29 02:04:36,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2020-07-29 02:04:36,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-07-29 02:04:36,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-07-29 02:04:36,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2020-07-29 02:04:36,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:04:36,916 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-07-29 02:04:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2020-07-29 02:04:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-29 02:04:36,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:04:36,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 55 transitions. Second operand 37 states. [2020-07-29 02:04:36,960 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 55 transitions. Second operand 37 states. [2020-07-29 02:04:36,965 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 37 states. [2020-07-29 02:04:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:36,973 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2020-07-29 02:04:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-07-29 02:04:36,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:04:36,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:04:36,982 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states and 55 transitions. [2020-07-29 02:04:36,982 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states and 55 transitions. [2020-07-29 02:04:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:36,990 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2020-07-29 02:04:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-07-29 02:04:36,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:04:36,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:04:36,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:04:36,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:04:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-29 02:04:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-07-29 02:04:37,007 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-07-29 02:04:37,007 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-07-29 02:04:37,007 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:04:37,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2020-07-29 02:04:37,009 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-07-29 02:04:37,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:04:37,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:04:37,012 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:04:37,013 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:04:37,013 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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 [2020-07-29 02:04:37,013 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~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.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~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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 [2020-07-29 02:04:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 02:04:37,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:37,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231205120] [2020-07-29 02:04:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:37,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:37,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:37,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:04:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-07-29 02:04:37,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:37,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922383202] [2020-07-29 02:04:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:04:37,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {212#true} 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; {212#true} is VALID [2020-07-29 02:04:37,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {212#true} 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; {214#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not |ULTIMATE.start_main_#t~short6|))} is VALID [2020-07-29 02:04:37,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {214#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not |ULTIMATE.start_main_#t~short6|))} 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; {215#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} is VALID [2020-07-29 02:04:37,280 INFO L280 TraceCheckUtils]: 3: Hoare triple {215#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; {215#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} is VALID [2020-07-29 02:04:37,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {215#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {216#(or (not (= 0 |ULTIMATE.start_main_#t~mem10.base|)) (not (= 0 |ULTIMATE.start_main_#t~mem10.offset|)))} is VALID [2020-07-29 02:04:37,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {216#(or (not (= 0 |ULTIMATE.start_main_#t~mem10.base|)) (not (= 0 |ULTIMATE.start_main_#t~mem10.offset|)))} assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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; {213#false} is VALID [2020-07-29 02:04:37,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {213#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {213#false} is VALID [2020-07-29 02:04:37,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {213#false} 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; {213#false} is VALID [2020-07-29 02:04:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:04:37,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922383202] [2020-07-29 02:04:37,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:04:37,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 02:04:37,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793685694] [2020-07-29 02:04:37,290 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 02:04:37,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:04:37,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 02:04:37,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 02:04:37,293 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2020-07-29 02:04:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:37,834 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2020-07-29 02:04:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 02:04:37,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 02:04:37,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:04:37,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2020-07-29 02:04:37,873 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2020-07-29 02:04:37,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2020-07-29 02:04:37,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-07-29 02:04:37,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-07-29 02:04:37,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2020-07-29 02:04:37,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:04:37,878 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2020-07-29 02:04:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2020-07-29 02:04:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-29 02:04:37,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:04:37,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states and 65 transitions. Second operand 40 states. [2020-07-29 02:04:37,887 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states and 65 transitions. Second operand 40 states. [2020-07-29 02:04:37,888 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 40 states. [2020-07-29 02:04:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:37,898 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2020-07-29 02:04:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2020-07-29 02:04:37,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:04:37,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:04:37,900 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states and 65 transitions. [2020-07-29 02:04:37,900 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states and 65 transitions. [2020-07-29 02:04:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:37,911 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2020-07-29 02:04:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2020-07-29 02:04:37,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:04:37,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:04:37,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:04:37,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:04:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 02:04:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-07-29 02:04:37,919 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-07-29 02:04:37,919 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-07-29 02:04:37,919 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:04:37,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2020-07-29 02:04:37,920 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2020-07-29 02:04:37,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:04:37,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:04:37,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:04:37,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:04:37,922 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 282#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); 266#L557-2 [2020-07-29 02:04:37,922 INFO L796 eck$LassoCheckResult]: Loop: 266#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; 272#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; 268#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; 269#L546-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; 302#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 287#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 288#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 265#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; 266#L557-2 [2020-07-29 02:04:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:37,925 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-07-29 02:04:37,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:37,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960617946] [2020-07-29 02:04:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:37,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:37,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:37,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:04:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-07-29 02:04:37,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:37,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793295330] [2020-07-29 02:04:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:37,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:37,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:37,984 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:04:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-07-29 02:04:37,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:37,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736100081] [2020-07-29 02:04:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:04:38,121 INFO L280 TraceCheckUtils]: 0: Hoare triple {398#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {398#true} is VALID [2020-07-29 02:04:38,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {398#true} 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); {400#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)))} is VALID [2020-07-29 02:04:38,126 INFO L280 TraceCheckUtils]: 2: Hoare triple {400#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)))} 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; {401#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)))} is VALID [2020-07-29 02:04:38,128 INFO L280 TraceCheckUtils]: 3: Hoare triple {401#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)))} 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; {402#(not |ULTIMATE.start_main_#t~short6|)} is VALID [2020-07-29 02:04:38,129 INFO L280 TraceCheckUtils]: 4: Hoare triple {402#(not |ULTIMATE.start_main_#t~short6|)} 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; {399#false} is VALID [2020-07-29 02:04:38,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {399#false} assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; {399#false} is VALID [2020-07-29 02:04:38,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {399#false} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {399#false} is VALID [2020-07-29 02:04:38,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {399#false} assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; {399#false} is VALID [2020-07-29 02:04:38,130 INFO L280 TraceCheckUtils]: 8: Hoare triple {399#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {399#false} is VALID [2020-07-29 02:04:38,131 INFO L280 TraceCheckUtils]: 9: Hoare triple {399#false} 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; {399#false} is VALID [2020-07-29 02:04:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:04:38,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736100081] [2020-07-29 02:04:38,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:04:38,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 02:04:38,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104903378] [2020-07-29 02:04:38,317 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-07-29 02:04:38,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:04:38,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 02:04:38,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 02:04:38,395 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2020-07-29 02:04:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:39,513 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2020-07-29 02:04:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 02:04:39,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 02:04:39,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:04:39,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2020-07-29 02:04:39,535 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2020-07-29 02:04:39,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2020-07-29 02:04:39,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-07-29 02:04:39,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-07-29 02:04:39,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2020-07-29 02:04:39,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:04:39,541 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2020-07-29 02:04:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2020-07-29 02:04:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2020-07-29 02:04:39,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:04:39,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states and 137 transitions. Second operand 48 states. [2020-07-29 02:04:39,546 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states and 137 transitions. Second operand 48 states. [2020-07-29 02:04:39,546 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 48 states. [2020-07-29 02:04:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:39,550 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2020-07-29 02:04:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2020-07-29 02:04:39,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:04:39,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:04:39,551 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 92 states and 137 transitions. [2020-07-29 02:04:39,552 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 92 states and 137 transitions. [2020-07-29 02:04:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:04:39,556 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2020-07-29 02:04:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2020-07-29 02:04:39,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:04:39,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:04:39,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:04:39,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:04:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 02:04:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2020-07-29 02:04:39,561 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-07-29 02:04:39,561 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-07-29 02:04:39,561 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:04:39,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2020-07-29 02:04:39,562 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2020-07-29 02:04:39,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:04:39,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:04:39,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:04:39,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:04:39,564 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 516#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); 517#L557-2 [2020-07-29 02:04:39,564 INFO L796 eck$LassoCheckResult]: Loop: 517#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; 532#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; 504#L546-1 assume !main_#t~short6; 505#L546-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset; 513#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 545#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 525#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 526#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; 517#L557-2 [2020-07-29 02:04:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-07-29 02:04:39,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:39,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33060557] [2020-07-29 02:04:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:39,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:39,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:39,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:04:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-07-29 02:04:39,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:39,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261404779] [2020-07-29 02:04:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:39,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:39,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:39,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:04:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:04:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-07-29 02:04:39,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:04:39,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019410873] [2020-07-29 02:04:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:04:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:39,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:04:39,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:04:39,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:04:39,792 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-07-29 02:04:39,982 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2020-07-29 02:04:40,059 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 02:04:40,123 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 02:04:40,125 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 02:04:40,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:115, output treesize:103 [2020-07-29 02:04:40,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:04:40 BoogieIcfgContainer [2020-07-29 02:04:40,253 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:04:40,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:04:40,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:04:40,254 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:04:40,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:04:36" (3/4) ... [2020-07-29 02:04:40,259 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 02:04:40,350 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 02:04:40,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:04:40,353 INFO L168 Benchmark]: Toolchain (without parser) took 5837.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -133.2 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2020-07-29 02:04:40,353 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:04:40,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2020-07-29 02:04:40,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.64 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. [2020-07-29 02:04:40,356 INFO L168 Benchmark]: Boogie Preprocessor took 93.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:04:40,363 INFO L168 Benchmark]: RCFGBuilder took 1039.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:04:40,364 INFO L168 Benchmark]: BuchiAutomizer took 3862.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -40.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2020-07-29 02:04:40,366 INFO L168 Benchmark]: Witness Printer took 96.42 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. [2020-07-29 02:04:40,379 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 658.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1039.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3862.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -40.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Witness Printer took 96.42 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. * 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.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.6s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.1s 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.6s 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=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@30960c54=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@334d50=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bcd7b1c=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ef0d53a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64160126=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31bad377=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d5b5624=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@606f61ad=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e342620=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@30960c54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b76e98c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c53bad2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@132ff0bc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14fdddd2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c78a38b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@407090d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e342620=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c53bad2=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@132ff0bc=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@753bfe3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@606f61ad=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35440c2e=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@590c01ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bcd7b1c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5994e920=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f7ed4ea=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64160126=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22344c1d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@753bfe3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31bad377=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@407090d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e7bc1e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24deb715=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58a797fa=19, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35a234ff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1f9da1ef=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@13176f8d=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@590c01ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35440c2e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@915a97c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ef0d53a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d5b5624=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@250657d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22344c1d=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@66e2e3b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4434a93f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e7bc1e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@250657d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@915a97c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@990e5e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@172a0234=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@338ee503=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3044e41b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@13176f8d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b9349ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@334d50=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5994e920=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f7ed4ea=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@990e5e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4434a93f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b9349ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fef1dec=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c78a38b=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...