./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-recursive-malloc/rec_malloc_ex5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash f7c8cd0f6441598a9b17eacee015376606f871a4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:40:21,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:40:21,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:40:21,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:40:21,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:40:21,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:40:21,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:40:21,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:40:21,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:40:21,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:40:21,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:40:21,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:40:21,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:40:21,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:40:21,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:40:21,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:40:21,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:40:21,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:40:21,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:40:21,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:40:21,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:40:21,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:40:21,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:40:21,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:40:21,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:40:21,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:40:21,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:40:21,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:40:21,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:40:21,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:40:21,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:40:21,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:40:21,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:40:21,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:40:21,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:40:21,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:40:21,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:40:21,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:40:21,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:40:21,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:40:21,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:40:21,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:40:21,427 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:40:21,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:40:21,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:40:21,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:40:21,429 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:40:21,430 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:40:21,430 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:40:21,430 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:40:21,431 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:40:21,431 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:40:21,432 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:40:21,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:40:21,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:40:21,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:40:21,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:40:21,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:40:21,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:40:21,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:40:21,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:40:21,435 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:40:21,435 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:40:21,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:40:21,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:40:21,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:40:21,436 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:40:21,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:40:21,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:40:21,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:40:21,438 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:40:21,439 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:40:21,439 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7c8cd0f6441598a9b17eacee015376606f871a4 [2020-07-29 01:40:21,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:40:21,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:40:21,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:40:21,745 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:40:21,745 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:40:21,746 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2020-07-29 01:40:21,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f58b2f7a/e59eb5fabef94f8d9d2d59d61882afac/FLAGf3950a2c4 [2020-07-29 01:40:22,173 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:40:22,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2020-07-29 01:40:22,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f58b2f7a/e59eb5fabef94f8d9d2d59d61882afac/FLAGf3950a2c4 [2020-07-29 01:40:22,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f58b2f7a/e59eb5fabef94f8d9d2d59d61882afac [2020-07-29 01:40:22,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:40:22,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:40:22,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:40:22,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:40:22,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:40:22,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0a3ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22, skipping insertion in model container [2020-07-29 01:40:22,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:40:22,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:40:22,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:40:22,818 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:40:22,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:40:22,870 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:40:22,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22 WrapperNode [2020-07-29 01:40:22,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:40:22,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:40:22,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:40:22,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:40:22,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:40:22,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:40:22,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:40:22,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:40:23,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:23,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:23,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:23,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:23,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:23,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:23,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:23,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:40:23,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:40:23,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:40:23,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:40:23,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (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 01:40:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:40:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:40:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-29 01:40:23,123 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-29 01:40:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-29 01:40:23,124 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-29 01:40:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:40:23,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:40:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:40:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:40:23,592 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:40:23,593 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:40:23,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:40:23 BoogieIcfgContainer [2020-07-29 01:40:23,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:40:23,597 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:40:23,597 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:40:23,604 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:40:23,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:23,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:40:22" (1/3) ... [2020-07-29 01:40:23,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b7b8a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:40:23, skipping insertion in model container [2020-07-29 01:40:23,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:23,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (2/3) ... [2020-07-29 01:40:23,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b7b8a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:40:23, skipping insertion in model container [2020-07-29 01:40:23,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:23,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:40:23" (3/3) ... [2020-07-29 01:40:23,614 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5.i [2020-07-29 01:40:23,662 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:40:23,662 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:40:23,662 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:40:23,662 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:40:23,662 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:40:23,662 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:40:23,662 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:40:23,663 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:40:23,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-29 01:40:23,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:40:23,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:23,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:23,719 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:40:23,719 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:23,719 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:40:23,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-29 01:40:23,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:40:23,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:23,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:23,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:40:23,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:23,734 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 13#L63true assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 8#L63-2true assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 21#L66true call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 18#fENTRYtrue [2020-07-29 01:40:23,735 INFO L796 eck$LassoCheckResult]: Loop: 18#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 11#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 19#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 15#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 3#L34true assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 4#gFINALtrue assume true; 7#gEXITtrue >#37#return; 22#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 18#fENTRYtrue [2020-07-29 01:40:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 1 times [2020-07-29 01:40:23,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:23,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169537653] [2020-07-29 01:40:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:23,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:23,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1513071857, now seen corresponding path program 1 times [2020-07-29 01:40:23,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:23,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625946643] [2020-07-29 01:40:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:24,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:40:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:24,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {36#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} is VALID [2020-07-29 01:40:24,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:24,163 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:24,166 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {29#false} is VALID [2020-07-29 01:40:24,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {28#true} is VALID [2020-07-29 01:40:24,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2020-07-29 01:40:24,175 INFO L263 TraceCheckUtils]: 2: Hoare triple {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {35#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:24,178 INFO L280 TraceCheckUtils]: 3: Hoare triple {35#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {36#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} is VALID [2020-07-29 01:40:24,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:24,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:24,185 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {37#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {30#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {29#false} is VALID [2020-07-29 01:40:24,185 INFO L263 TraceCheckUtils]: 7: Hoare triple {29#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {29#false} is VALID [2020-07-29 01:40:24,187 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 01:40:24,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625946643] [2020-07-29 01:40:24,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:40:24,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:40:24,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851917644] [2020-07-29 01:40:24,197 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:40:24,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:40:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:40:24,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:40:24,220 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2020-07-29 01:40:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:24,635 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-29 01:40:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:40:24,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:40:24,661 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 01:40:24,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2020-07-29 01:40:24,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:40:24,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2020-07-29 01:40:24,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:40:24,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:40:24,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-07-29 01:40:24,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:40:24,681 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:40:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-07-29 01:40:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 01:40:24,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:24,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 20 transitions. Second operand 17 states. [2020-07-29 01:40:24,714 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 20 transitions. Second operand 17 states. [2020-07-29 01:40:24,716 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 17 states. [2020-07-29 01:40:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:24,719 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-29 01:40:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-07-29 01:40:24,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:24,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:24,722 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 20 transitions. [2020-07-29 01:40:24,722 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 20 transitions. [2020-07-29 01:40:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:24,725 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-29 01:40:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-07-29 01:40:24,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:24,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:24,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:24,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:40:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 01:40:24,732 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:40:24,732 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:40:24,732 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:40:24,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 01:40:24,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:40:24,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:24,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:24,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:40:24,735 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:24,736 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 76#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 77#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 71#L63-2 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 72#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 79#fENTRY [2020-07-29 01:40:24,736 INFO L796 eck$LassoCheckResult]: Loop: 79#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 74#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 65#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 69#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 66#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 69#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 67#gFINAL assume true; 68#gEXIT >#41#return; 70#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 73#gFINAL assume true; 80#gEXIT >#37#return; 75#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 79#fENTRY [2020-07-29 01:40:24,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 2 times [2020-07-29 01:40:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:24,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387825954] [2020-07-29 01:40:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:24,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:24,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:24,785 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:24,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash 916774883, now seen corresponding path program 1 times [2020-07-29 01:40:24,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:24,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155395009] [2020-07-29 01:40:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:24,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:40:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:40:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {141#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} is VALID [2020-07-29 01:40:25,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:25,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:25,102 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {135#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)))} #41#return; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2020-07-29 01:40:25,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {134#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= |#memory_int| |old(#memory_int)|))} is VALID [2020-07-29 01:40:25,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= |#memory_int| |old(#memory_int)|))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {135#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)))} is VALID [2020-07-29 01:40:25,108 INFO L263 TraceCheckUtils]: 2: Hoare triple {135#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:25,109 INFO L280 TraceCheckUtils]: 3: Hoare triple {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {141#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} is VALID [2020-07-29 01:40:25,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:25,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:25,114 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {135#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)))} #41#return; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2020-07-29 01:40:25,115 INFO L280 TraceCheckUtils]: 7: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2020-07-29 01:40:25,116 INFO L280 TraceCheckUtils]: 8: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2020-07-29 01:40:25,118 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {121#false} is VALID [2020-07-29 01:40:25,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {120#true} is VALID [2020-07-29 01:40:25,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2020-07-29 01:40:25,123 INFO L263 TraceCheckUtils]: 2: Hoare triple {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:25,124 INFO L280 TraceCheckUtils]: 3: Hoare triple {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {134#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= |#memory_int| |old(#memory_int)|))} is VALID [2020-07-29 01:40:25,126 INFO L280 TraceCheckUtils]: 4: Hoare triple {134#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= |#memory_int| |old(#memory_int)|))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {135#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)))} is VALID [2020-07-29 01:40:25,128 INFO L263 TraceCheckUtils]: 5: Hoare triple {135#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:25,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {133#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {141#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} is VALID [2020-07-29 01:40:25,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#(= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|)} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:25,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2020-07-29 01:40:25,134 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {142#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {135#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)))} #41#return; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2020-07-29 01:40:25,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2020-07-29 01:40:25,136 INFO L280 TraceCheckUtils]: 11: Hoare triple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2020-07-29 01:40:25,137 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {140#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {121#false} is VALID [2020-07-29 01:40:25,138 INFO L263 TraceCheckUtils]: 13: Hoare triple {121#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {121#false} is VALID [2020-07-29 01:40:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:40:25,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155395009] [2020-07-29 01:40:25,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099806296] [2020-07-29 01:40:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:40:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-29 01:40:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:25,319 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:40:25,320 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:25,328 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:25,334 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:25,335 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:8 [2020-07-29 01:40:25,339 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:25,339 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, f_~v]. (and (= |#memory_int| (store |v_#memory_int_19| f_~tmp~0.base (store (select |v_#memory_int_19| f_~tmp~0.base) f_~tmp~0.offset (+ f_~v 1)))) (not (< f_~v 0))) [2020-07-29 01:40:25,340 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (< (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset) 1)) [2020-07-29 01:40:25,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {120#true} is VALID [2020-07-29 01:40:25,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2020-07-29 01:40:25,552 INFO L263 TraceCheckUtils]: 2: Hoare triple {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {152#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-29 01:40:25,553 INFO L280 TraceCheckUtils]: 3: Hoare triple {152#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {134#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= |#memory_int| |old(#memory_int)|))} is VALID [2020-07-29 01:40:25,554 INFO L280 TraceCheckUtils]: 4: Hoare triple {134#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= |#memory_int| |old(#memory_int)|))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; {159#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset (+ (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (- 1)))) |#memory_int|))} is VALID [2020-07-29 01:40:25,556 INFO L263 TraceCheckUtils]: 5: Hoare triple {159#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset (+ (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (- 1)))) |#memory_int|))} call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset); {152#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-29 01:40:25,557 INFO L280 TraceCheckUtils]: 6: Hoare triple {152#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); {166#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|))} is VALID [2020-07-29 01:40:25,559 INFO L280 TraceCheckUtils]: 7: Hoare triple {166#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem5|))} assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; {170#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= |#memory_int| |old(#memory_int)|))} is VALID [2020-07-29 01:40:25,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {170#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= |#memory_int| |old(#memory_int)|))} assume true; {170#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= |#memory_int| |old(#memory_int)|))} is VALID [2020-07-29 01:40:25,563 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {170#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= |#memory_int| |old(#memory_int)|))} {159#(and (= |g_#in~p.offset| g_~p.offset) (= |g_#in~p.base| g_~p.base) (= (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset (+ (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (- 1)))) |#memory_int|))} #41#return; {177#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (- 1)))) |#memory_int|))} is VALID [2020-07-29 01:40:25,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {177#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (- 1)))) |#memory_int|))} ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; {177#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (- 1)))) |#memory_int|))} is VALID [2020-07-29 01:40:25,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {177#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (- 1)))) |#memory_int|))} assume true; {177#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (- 1)))) |#memory_int|))} is VALID [2020-07-29 01:40:25,568 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {177#(and (<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (- 1)))) |#memory_int|))} {122#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #37#return; {121#false} is VALID [2020-07-29 01:40:25,568 INFO L263 TraceCheckUtils]: 13: Hoare triple {121#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {121#false} is VALID [2020-07-29 01:40:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:40:25,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:40:25,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-29 01:40:25,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420643590] [2020-07-29 01:40:25,572 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:40:25,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:40:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:40:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:40:25,573 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 14 states. [2020-07-29 01:40:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:26,256 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:40:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:40:26,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:40:26,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:26,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-07-29 01:40:26,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:40:26,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2020-07-29 01:40:26,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 01:40:26,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:40:26,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2020-07-29 01:40:26,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:40:26,321 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:40:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2020-07-29 01:40:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 01:40:26,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:26,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 23 transitions. Second operand 20 states. [2020-07-29 01:40:26,329 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 23 transitions. Second operand 20 states. [2020-07-29 01:40:26,329 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 20 states. [2020-07-29 01:40:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:26,332 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:40:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:40:26,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:26,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:26,333 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 23 transitions. [2020-07-29 01:40:26,333 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 23 transitions. [2020-07-29 01:40:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:26,339 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:40:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:40:26,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:26,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:26,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:26,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:40:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-07-29 01:40:26,348 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:40:26,348 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:40:26,349 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:40:26,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:40:26,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:40:26,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:26,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:26,358 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:40:26,358 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:26,359 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 225#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 226#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 220#L63-2 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 221#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 228#fENTRY [2020-07-29 01:40:26,359 INFO L796 eck$LassoCheckResult]: Loop: 228#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 223#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 214#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 218#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 213#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 215#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 218#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 213#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 215#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 218#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 213#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 216#gFINAL assume true; 217#gEXIT >#41#return; 219#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 222#gFINAL assume true; 232#gEXIT >#41#return; 230#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 231#gFINAL assume true; 229#gEXIT >#37#return; 224#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 228#fENTRY [2020-07-29 01:40:26,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:26,359 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 3 times [2020-07-29 01:40:26,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:26,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304650249] [2020-07-29 01:40:26,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,422 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1267451407, now seen corresponding path program 2 times [2020-07-29 01:40:26,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:26,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535402227] [2020-07-29 01:40:26,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594769, now seen corresponding path program 1 times [2020-07-29 01:40:26,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:26,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257616202] [2020-07-29 01:40:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:27,278 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2020-07-29 01:40:27,518 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-07-29 01:40:28,239 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 112 [2020-07-29 01:40:28,547 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-07-29 01:40:28,760 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-29 01:40:29,604 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 129 [2020-07-29 01:40:29,998 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-07-29 01:40:30,172 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-29 01:40:41,050 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2020-07-29 01:40:41,051 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.predicateBasedResultCheck(TransFormulaUtils.java:692) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialCompositionWithPendingCall(TransFormulaUtils.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeTF(LassoCheck.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeLoopTF(LassoCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:850) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 29 more [2020-07-29 01:40:41,056 INFO L168 Benchmark]: Toolchain (without parser) took 18499.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.6 MB). Free memory was 957.5 MB in the beginning and 860.4 MB in the end (delta: 97.1 MB). Peak memory consumption was 397.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:41,056 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:41,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:41,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:41,060 INFO L168 Benchmark]: Boogie Preprocessor took 52.58 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 01:40:41,063 INFO L168 Benchmark]: RCFGBuilder took 551.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:41,065 INFO L168 Benchmark]: BuchiAutomizer took 17456.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 860.4 MB in the end (delta: 251.2 MB). Peak memory consumption was 397.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:41,069 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.58 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 551.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17456.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 860.4 MB in the end (delta: 251.2 MB). Peak memory consumption was 397.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...