./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.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_ex9.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 2aaf551f63785020042d5272893266519060a07e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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: AssertionError: No Interpolants --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:41:18,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:41:18,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:41:18,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:41:18,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:41:18,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:41:18,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:41:18,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:41:18,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:41:18,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:41:18,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:41:19,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:41:19,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:41:19,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:41:19,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:41:19,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:41:19,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:41:19,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:41:19,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:41:19,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:41:19,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:41:19,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:41:19,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:41:19,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:41:19,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:41:19,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:41:19,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:41:19,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:41:19,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:41:19,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:41:19,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:41:19,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:41:19,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:41:19,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:41:19,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:41:19,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:41:19,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:41:19,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:41:19,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:41:19,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:41:19,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:41:19,031 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:41:19,047 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:41:19,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:41:19,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:41:19,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:41:19,049 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:41:19,049 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:41:19,050 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:41:19,050 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:41:19,050 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:41:19,050 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:41:19,050 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:41:19,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:41:19,051 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:41:19,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:41:19,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:41:19,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:41:19,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:41:19,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:41:19,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:41:19,052 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:41:19,053 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:41:19,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:41:19,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:41:19,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:41:19,053 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:41:19,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:41:19,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:41:19,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:41:19,054 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:41:19,055 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:41:19,055 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 -> 2aaf551f63785020042d5272893266519060a07e [2020-07-29 01:41:19,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:41:19,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:41:19,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:41:19,358 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:41:19,359 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:41:19,360 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2020-07-29 01:41:19,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ac34c31/93e0b03e60374554b26ae91e4f88d3e3/FLAG636c0e64a [2020-07-29 01:41:19,886 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:41:19,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2020-07-29 01:41:19,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ac34c31/93e0b03e60374554b26ae91e4f88d3e3/FLAG636c0e64a [2020-07-29 01:41:20,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ac34c31/93e0b03e60374554b26ae91e4f88d3e3 [2020-07-29 01:41:20,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:41:20,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:41:20,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:41:20,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:41:20,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:41:20,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4374af48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20, skipping insertion in model container [2020-07-29 01:41:20,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:41:20,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:41:20,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:41:20,503 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:41:20,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:41:20,541 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:41:20,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20 WrapperNode [2020-07-29 01:41:20,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:41:20,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:41:20,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:41:20,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:41:20,553 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:41:20" (1/1) ... [2020-07-29 01:41:20,563 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:41:20" (1/1) ... [2020-07-29 01:41:20,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:41:20,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:41:20,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:41:20,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:41:20,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (1/1) ... [2020-07-29 01:41:20,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:41:20,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:41:20,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:41:20,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:41:20,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (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:41:20,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:41:20,750 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2020-07-29 01:41:20,750 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2020-07-29 01:41:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:41:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:41:20,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:41:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:41:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:41:21,096 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:41:21,097 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:41:21,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:21 BoogieIcfgContainer [2020-07-29 01:41:21,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:41:21,102 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:41:21,102 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:41:21,106 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:41:21,107 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:21,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:41:20" (1/3) ... [2020-07-29 01:41:21,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7435456f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:41:21, skipping insertion in model container [2020-07-29 01:41:21,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:21,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:20" (2/3) ... [2020-07-29 01:41:21,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7435456f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:41:21, skipping insertion in model container [2020-07-29 01:41:21,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:21,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:21" (3/3) ... [2020-07-29 01:41:21,111 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex9.i [2020-07-29 01:41:21,169 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:41:21,169 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:41:21,169 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:41:21,169 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:41:21,169 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:41:21,169 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:41:21,170 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:41:21,170 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:41:21,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:41:21,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:41:21,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:21,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:21,230 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:41:21,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:21,231 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:41:21,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:41:21,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:41:21,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:21,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:21,237 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:41:21,238 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:21,246 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 3#L29-3true [2020-07-29 01:41:21,247 INFO L796 eck$LassoCheckResult]: Loop: 3#L29-3true call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 6#L29-1true assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 13#L33true call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 5#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 9#L9true assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 16#recFINALtrue assume true; 14#recEXITtrue >#33#return; 12#L33-1true havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 3#L29-3true [2020-07-29 01:41:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2020-07-29 01:41:21,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:21,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022863422] [2020-07-29 01:41:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:21,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:21,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:21,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:21,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2020-07-29 01:41:21,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:21,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240952180] [2020-07-29 01:41:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:21,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:41:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:21,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {31#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:21,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:21,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#(<= (+ |rec_#in~i| 1) 0)} assume true; {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:21,833 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#(<= (+ |rec_#in~i| 1) 0)} {25#(or (= 0 |ULTIMATE.start_main_#t~mem10|) (<= 1 |ULTIMATE.start_main_#t~mem10|))} #33#return; {23#false} is VALID [2020-07-29 01:41:21,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {24#(= (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset) |ULTIMATE.start_main_#t~mem6|)} is VALID [2020-07-29 01:41:21,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#(= (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset) |ULTIMATE.start_main_#t~mem6|)} assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); {25#(or (= 0 |ULTIMATE.start_main_#t~mem10|) (<= 1 |ULTIMATE.start_main_#t~mem10|))} is VALID [2020-07-29 01:41:21,844 INFO L263 TraceCheckUtils]: 2: Hoare triple {25#(or (= 0 |ULTIMATE.start_main_#t~mem10|) (<= 1 |ULTIMATE.start_main_#t~mem10|))} call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10); {30#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:41:21,846 INFO L280 TraceCheckUtils]: 3: Hoare triple {30#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {31#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:21,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:21,851 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#(<= (+ |rec_#in~i| 1) 0)} assume true; {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:21,855 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {32#(<= (+ |rec_#in~i| 1) 0)} {25#(or (= 0 |ULTIMATE.start_main_#t~mem10|) (<= 1 |ULTIMATE.start_main_#t~mem10|))} #33#return; {23#false} is VALID [2020-07-29 01:41:21,855 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; {23#false} is VALID [2020-07-29 01:41:21,857 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:41:21,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240952180] [2020-07-29 01:41:21,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:41:21,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:41:21,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225615083] [2020-07-29 01:41:21,870 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:41:21,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:41:21,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:41:21,891 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 7 states. [2020-07-29 01:41:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:22,307 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-29 01:41:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:41:22,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:41:22,333 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:41:22,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2020-07-29 01:41:22,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:41:22,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2020-07-29 01:41:22,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:41:22,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:41:22,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2020-07-29 01:41:22,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:22,354 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:41:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2020-07-29 01:41:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-29 01:41:22,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:22,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 16 transitions. Second operand 14 states. [2020-07-29 01:41:22,387 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 16 transitions. Second operand 14 states. [2020-07-29 01:41:22,389 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 14 states. [2020-07-29 01:41:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:22,393 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-29 01:41:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:41:22,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:22,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:22,395 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states and 16 transitions. [2020-07-29 01:41:22,396 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states and 16 transitions. [2020-07-29 01:41:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:22,399 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-29 01:41:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:41:22,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:22,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:22,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:22,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:41:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-07-29 01:41:22,405 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:41:22,405 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:41:22,405 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:41:22,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:41:22,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:41:22,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:22,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:22,408 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:41:22,409 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:22,409 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 55#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 56#L29-3 [2020-07-29 01:41:22,409 INFO L796 eck$LassoCheckResult]: Loop: 56#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 61#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 59#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 64#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 57#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 58#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 64#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 57#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 60#recFINAL assume true; 67#recEXIT >#31#return; 62#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 63#recFINAL assume true; 68#recEXIT >#33#return; 66#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 56#L29-3 [2020-07-29 01:41:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2020-07-29 01:41:22,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:22,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035385141] [2020-07-29 01:41:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:22,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:22,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:22,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2020-07-29 01:41:22,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:22,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696474582] [2020-07-29 01:41:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:22,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:22,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:22,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:22,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1849555021, now seen corresponding path program 1 times [2020-07-29 01:41:22,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:22,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999851837] [2020-07-29 01:41:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:22,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:41:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:22,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:41:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:22,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:22,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:22,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:22,857 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {120#(= rec_~i |rec_#in~i|)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:22,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:22,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; {120#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:22,862 INFO L263 TraceCheckUtils]: 2: Hoare triple {120#(= rec_~i |rec_#in~i|)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:41:22,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:22,865 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:22,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:22,869 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {120#(= rec_~i |rec_#in~i|)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:22,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {125#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:22,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {125#(<= |rec_#in~i| 0)} assume true; {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:22,873 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {125#(<= |rec_#in~i| 0)} {108#(<= 1 |ULTIMATE.start_main_#t~mem10|)} #33#return; {105#false} is VALID [2020-07-29 01:41:22,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-29 01:41:22,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#true} havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; {106#(not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base))} is VALID [2020-07-29 01:41:22,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#(not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base))} call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {107#(and (not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset) |ULTIMATE.start_main_#t~mem6|))} is VALID [2020-07-29 01:41:22,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {107#(and (not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset) |ULTIMATE.start_main_#t~mem6|))} assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); {108#(<= 1 |ULTIMATE.start_main_#t~mem10|)} is VALID [2020-07-29 01:41:22,882 INFO L263 TraceCheckUtils]: 4: Hoare triple {108#(<= 1 |ULTIMATE.start_main_#t~mem10|)} call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10); {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:41:22,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:22,884 INFO L280 TraceCheckUtils]: 6: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; {120#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:22,887 INFO L263 TraceCheckUtils]: 7: Hoare triple {120#(= rec_~i |rec_#in~i|)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:41:22,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {119#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2020-07-29 01:41:22,890 INFO L280 TraceCheckUtils]: 9: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:22,891 INFO L280 TraceCheckUtils]: 10: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:22,893 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {120#(= rec_~i |rec_#in~i|)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:22,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {125#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:22,895 INFO L280 TraceCheckUtils]: 13: Hoare triple {125#(<= |rec_#in~i| 0)} assume true; {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:22,897 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {125#(<= |rec_#in~i| 0)} {108#(<= 1 |ULTIMATE.start_main_#t~mem10|)} #33#return; {105#false} is VALID [2020-07-29 01:41:22,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {105#false} havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; {105#false} is VALID [2020-07-29 01:41:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:41:22,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999851837] [2020-07-29 01:41:22,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615524385] [2020-07-29 01:41:22,901 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:41:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:22,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-29 01:41:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:22,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:23,069 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 01:41:23,090 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:23,094 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:23,095 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:23,095 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-07-29 01:41:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:41:23,273 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:41:23,288 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:23,294 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:23,304 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:23,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:111, output treesize:3 [2020-07-29 01:41:23,312 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:41:23,313 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, ULTIMATE.start_main_~qq~0.base, ULTIMATE.start_main_~qq~0.offset, ULTIMATE.start_main_~pp~0.base, ULTIMATE.start_main_~pp~0.offset]. (let ((.cse4 (select |v_#memory_int_17| ULTIMATE.start_main_~qq~0.base))) (let ((.cse0 (select .cse4 ULTIMATE.start_main_~qq~0.offset))) (and (not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base)) (<= 2 .cse0) (<= (select (select (let ((.cse1 (let ((.cse3 (+ .cse0 (- 1)))) (let ((.cse2 (store |v_#memory_int_17| ULTIMATE.start_main_~qq~0.base (store .cse4 ULTIMATE.start_main_~qq~0.offset .cse3)))) (store .cse2 ULTIMATE.start_main_~pp~0.base (store (select .cse2 ULTIMATE.start_main_~pp~0.base) ULTIMATE.start_main_~pp~0.offset .cse3)))))) (store .cse1 ULTIMATE.start_main_~qq~0.base (store (select .cse1 ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset 0))) ULTIMATE.start_main_~pp~0.base) ULTIMATE.start_main_~pp~0.offset) |ULTIMATE.start_main_#t~mem10|)))) [2020-07-29 01:41:23,313 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |ULTIMATE.start_main_#t~mem10|) [2020-07-29 01:41:23,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-29 01:41:23,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#true} havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; {106#(not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base))} is VALID [2020-07-29 01:41:23,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#(not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base))} call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {136#(and (not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base)) (<= |ULTIMATE.start_main_#t~mem6| (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)))} is VALID [2020-07-29 01:41:23,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#(and (not (= ULTIMATE.start_main_~qq~0.base ULTIMATE.start_main_~pp~0.base)) (<= |ULTIMATE.start_main_#t~mem6| (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)))} assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); {108#(<= 1 |ULTIMATE.start_main_#t~mem10|)} is VALID [2020-07-29 01:41:23,547 INFO L263 TraceCheckUtils]: 4: Hoare triple {108#(<= 1 |ULTIMATE.start_main_#t~mem10|)} call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10); {104#true} is VALID [2020-07-29 01:41:23,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {104#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {146#(<= |rec_#in~i| rec_~i)} is VALID [2020-07-29 01:41:23,551 INFO L280 TraceCheckUtils]: 6: Hoare triple {146#(<= |rec_#in~i| rec_~i)} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; {146#(<= |rec_#in~i| rec_~i)} is VALID [2020-07-29 01:41:23,551 INFO L263 TraceCheckUtils]: 7: Hoare triple {146#(<= |rec_#in~i| rec_~i)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {104#true} is VALID [2020-07-29 01:41:23,552 INFO L280 TraceCheckUtils]: 8: Hoare triple {104#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {146#(<= |rec_#in~i| rec_~i)} is VALID [2020-07-29 01:41:23,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {146#(<= |rec_#in~i| rec_~i)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:23,556 INFO L280 TraceCheckUtils]: 10: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2020-07-29 01:41:23,559 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {146#(<= |rec_#in~i| rec_~i)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:23,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {125#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:23,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {125#(<= |rec_#in~i| 0)} assume true; {125#(<= |rec_#in~i| 0)} is VALID [2020-07-29 01:41:23,563 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {125#(<= |rec_#in~i| 0)} {108#(<= 1 |ULTIMATE.start_main_#t~mem10|)} #33#return; {105#false} is VALID [2020-07-29 01:41:23,564 INFO L280 TraceCheckUtils]: 15: Hoare triple {105#false} havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; {105#false} is VALID [2020-07-29 01:41:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:41:23,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:41:23,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2020-07-29 01:41:23,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953301274] [2020-07-29 01:41:23,998 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2020-07-29 01:41:25,277 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2020-07-29 01:41:25,595 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-07-29 01:41:25,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:41:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:41:25,597 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-07-29 01:41:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:25,953 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:41:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:41:25,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:41:25,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:26,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-07-29 01:41:26,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:41:26,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-07-29 01:41:26,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:41:26,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:41:26,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-07-29 01:41:26,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:26,007 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 01:41:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-07-29 01:41:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 01:41:26,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:26,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand 17 states. [2020-07-29 01:41:26,010 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand 17 states. [2020-07-29 01:41:26,010 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 17 states. [2020-07-29 01:41:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:26,012 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:41:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:41:26,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:26,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:26,013 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 19 transitions. [2020-07-29 01:41:26,013 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 19 transitions. [2020-07-29 01:41:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:26,016 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:41:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:41:26,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:26,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:26,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:26,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:41:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-29 01:41:26,019 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 01:41:26,019 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 01:41:26,019 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:41:26,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:41:26,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:41:26,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:26,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:26,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:41:26,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:26,021 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 199#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 200#L29-3 [2020-07-29 01:41:26,022 INFO L796 eck$LassoCheckResult]: Loop: 200#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 207#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 202#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 208#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 201#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 203#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 208#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 201#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 203#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 208#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 201#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 204#recFINAL assume true; 211#recEXIT >#31#return; 205#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 206#recFINAL assume true; 215#recEXIT >#31#return; 213#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 214#recFINAL assume true; 212#recEXIT >#33#return; 209#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11; 200#L29-3 [2020-07-29 01:41:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2020-07-29 01:41:26,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:26,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470186462] [2020-07-29 01:41:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:26,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:26,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:26,039 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2020-07-29 01:41:26,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:26,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814194762] [2020-07-29 01:41:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:26,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:26,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:26,094 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:26,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1421169023, now seen corresponding path program 2 times [2020-07-29 01:41:26,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:26,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327613458] [2020-07-29 01:41:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:26,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:26,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:26,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:26,601 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2020-07-29 01:41:27,605 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2020-07-29 01:41:27,973 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-07-29 01:41:29,474 WARN L193 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2020-07-29 01:41:29,913 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-07-29 01:41:30,093 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-07-29 01:41:30,228 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:41:30,229 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:41:30,229 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:41:30,229 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:41:30,230 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:41:30,230 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:30,230 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:41:30,230 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:41:30,230 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration3_Lasso [2020-07-29 01:41:30,230 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:41:30,230 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:41:30,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,571 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-07-29 01:41:30,908 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-29 01:41:30,911 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 01:41:30,912 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 01:41:30,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:30,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:31,710 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-07-29 01:41:31,885 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-07-29 01:41:32,162 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:41:32,168 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:41:32,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:32,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:32,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:32,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:32,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:32,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:32,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:32,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:32,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:32,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:32,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:32,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:32,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:32,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:41:32,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:32,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:32,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:32,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:32,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:32,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,464 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:41:32,464 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-07-29 01:41:32,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,528 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2020-07-29 01:41:32,528 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-07-29 01:41:32,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:32,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:32,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:41:32,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:32,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:32,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:32,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:32,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:32,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:32,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,773 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:41:32,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:41:32,880 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:41:32,946 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:32,952 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:41:32,952 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:41:32,953 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2020-07-29 01:41:33,060 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:41:33,071 INFO L393 LassoCheck]: Loop: "call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);" "assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);" "call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;" "call rec(~ip~0.base, ~ip~0.offset, ~i - 1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;" "call rec(~ip~0.base, ~ip~0.offset, ~i - 1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4);" "assume true;" >"#31#return;" "call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);" "assume true;" >"#31#return;" "call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);" "assume true;" >"#33#return;" "havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11;" [2020-07-29 01:41:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:33,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:41:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:33,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:41:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:33,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:33,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {259#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {259#unseeded} is VALID [2020-07-29 01:41:33,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {259#unseeded} havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; {259#unseeded} is VALID [2020-07-29 01:41:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:33,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 46 conjunts are in the unsatisfiable core [2020-07-29 01:41:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:33,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:33,314 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:33,315 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 47 [2020-07-29 01:41:33,328 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:41:33,348 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:33,399 INFO L624 ElimStorePlain]: treesize reduction 16, result has 75.0 percent of original size [2020-07-29 01:41:33,400 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:33,400 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:122, output treesize:48 [2020-07-29 01:41:38,368 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2020-07-29 01:41:38,369 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No Interpolants at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) 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) [2020-07-29 01:41:38,374 INFO L168 Benchmark]: Toolchain (without parser) took 18099.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 960.2 MB in the beginning and 854.3 MB in the end (delta: 105.9 MB). Peak memory consumption was 424.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:38,375 INFO L168 Benchmark]: CDTParser took 0.19 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:41:38,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.49 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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:41:38,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:38,377 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 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:41:38,378 INFO L168 Benchmark]: RCFGBuilder took 411.52 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:38,379 INFO L168 Benchmark]: BuchiAutomizer took 17269.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 854.3 MB in the end (delta: 243.6 MB). Peak memory consumption was 422.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:38,382 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.19 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 265.49 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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 108.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.63 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 411.52 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17269.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 854.3 MB in the end (delta: 243.6 MB). Peak memory consumption was 422.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No Interpolants de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No Interpolants: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:149) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...