./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_ex1.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 6b4114bc6a0e883536dbadf27d0e1e27273e6b7c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:43:46,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:43:46,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:43:46,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:43:46,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:43:46,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:43:46,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:43:46,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:43:46,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:43:46,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:43:46,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:43:46,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:43:46,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:43:46,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:43:46,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:43:46,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:43:46,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:43:46,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:43:46,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:43:46,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:43:46,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:43:46,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:43:46,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:43:46,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:43:46,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:43:46,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:43:46,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:43:46,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:43:46,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:43:46,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:43:46,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:43:46,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:43:46,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:43:46,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:43:46,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:43:46,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:43:46,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:43:46,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:43:46,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:43:46,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:43:46,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:43:46,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:43:46,740 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:43:46,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:43:46,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:43:46,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:43:46,742 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:43:46,742 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:43:46,743 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:43:46,743 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:43:46,743 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:43:46,743 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:43:46,744 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:43:46,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:43:46,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:43:46,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:43:46,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:43:46,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:43:46,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:43:46,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:43:46,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:43:46,746 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:43:46,746 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:43:46,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:43:46,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:43:46,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:43:46,747 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:43:46,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:43:46,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:43:46,748 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:43:46,748 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:43:46,749 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:43:46,749 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 -> 6b4114bc6a0e883536dbadf27d0e1e27273e6b7c [2020-10-20 06:43:46,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:43:46,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:43:46,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:43:46,970 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:43:46,971 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:43:46,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2020-10-20 06:43:47,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a078f5a7/c2ce3ba1ffdb47a99d1d60c74fd80e2c/FLAG5a11008ef [2020-10-20 06:43:47,558 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:43:47,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2020-10-20 06:43:47,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a078f5a7/c2ce3ba1ffdb47a99d1d60c74fd80e2c/FLAG5a11008ef [2020-10-20 06:43:47,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a078f5a7/c2ce3ba1ffdb47a99d1d60c74fd80e2c [2020-10-20 06:43:47,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:43:47,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:43:47,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:47,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:43:47,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:43:47,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:47" (1/1) ... [2020-10-20 06:43:47,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32135a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:47, skipping insertion in model container [2020-10-20 06:43:47,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:47" (1/1) ... [2020-10-20 06:43:47,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:43:47,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:43:48,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:48,195 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:43:48,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:48,238 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:43:48,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48 WrapperNode [2020-10-20 06:43:48,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:48,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:48,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:43:48,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:43:48,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:48,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:43:48,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:43:48,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:43:48,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (1/1) ... [2020-10-20 06:43:48,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:43:48,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:43:48,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:43:48,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:43:48,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (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-10-20 06:43:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:43:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2020-10-20 06:43:48,403 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2020-10-20 06:43:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 06:43:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:43:48,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:43:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:43:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:43:48,644 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:43:48,645 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-20 06:43:48,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:48 BoogieIcfgContainer [2020-10-20 06:43:48,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:43:48,648 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:43:48,648 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:43:48,652 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:43:48,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:48,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:43:47" (1/3) ... [2020-10-20 06:43:48,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c71453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:48, skipping insertion in model container [2020-10-20 06:43:48,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:48,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:48" (2/3) ... [2020-10-20 06:43:48,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c71453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:48, skipping insertion in model container [2020-10-20 06:43:48,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:48,657 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:48" (3/3) ... [2020-10-20 06:43:48,659 INFO L373 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2020-10-20 06:43:48,708 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:43:48,708 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:43:48,708 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:43:48,709 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:43:48,710 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:43:48,711 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:43:48,711 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:43:48,711 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:43:48,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-20 06:43:48,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:48,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:48,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:48,760 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:43:48,760 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:48,761 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:43:48,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-20 06:43:48,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:48,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:48,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:48,764 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:43:48,764 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:48,771 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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 18#L28-3true [2020-10-20 06:43:48,771 INFO L796 eck$LassoCheckResult]: Loop: 18#L28-3true call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 9#L31true call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 10#L9true assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 15#recFINALtrue assume true; 13#recEXITtrue >#33#return; 6#L31-1true havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 18#L28-3true [2020-10-20 06:43:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2020-10-20 06:43:48,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:48,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302235167] [2020-10-20 06:43:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:48,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:48,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:48,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2020-10-20 06:43:48,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:48,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407314642] [2020-10-20 06:43:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:48,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,045 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2020-10-20 06:43:49,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437635326] [2020-10-20 06:43:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:49,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-20 06:43:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:43:49,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437635326] [2020-10-20 06:43:49,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:43:49,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 06:43:49,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301761676] [2020-10-20 06:43:49,964 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2020-10-20 06:43:50,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:43:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:43:50,079 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 8 states. [2020-10-20 06:43:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:50,221 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-10-20 06:43:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:43:50,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2020-10-20 06:43:50,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:50,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2020-10-20 06:43:50,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:43:50,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:43:50,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2020-10-20 06:43:50,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:50,239 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 06:43:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2020-10-20 06:43:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-20 06:43:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:43:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-10-20 06:43:50,269 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 06:43:50,269 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 06:43:50,269 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:43:50,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-10-20 06:43:50,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:50,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:50,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:50,271 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:43:50,271 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:50,272 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 60#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 61#L28-3 [2020-10-20 06:43:50,272 INFO L796 eck$LassoCheckResult]: Loop: 61#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 68#L28-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 62#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 63#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 64#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 65#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 63#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 64#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 66#recFINAL assume true; 69#recEXIT >#31#return; 70#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 72#recFINAL assume true; 73#recEXIT >#33#return; 71#L31-1 havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 61#L28-3 [2020-10-20 06:43:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2020-10-20 06:43:50,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:50,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222173369] [2020-10-20 06:43:50,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:50,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:50,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:50,297 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:50,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2020-10-20 06:43:50,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:50,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379152163] [2020-10-20 06:43:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:50,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:43:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:50,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:43:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 06:43:50,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379152163] [2020-10-20 06:43:50,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134249064] [2020-10-20 06:43:50,478 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-10-20 06:43:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:50,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 06:43:50,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:50,663 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 28 [2020-10-20 06:43:50,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:43:50,670 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 06:43:50,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:43:50,694 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-20 06:43:50,695 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2020-10-20 06:43:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:43:50,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:43:50,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2020-10-20 06:43:50,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575093631] [2020-10-20 06:43:50,737 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:43:50,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:43:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:43:50,739 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-10-20 06:43:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:50,892 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-10-20 06:43:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:43:50,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-10-20 06:43:50,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:50,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-10-20 06:43:50,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 06:43:50,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 06:43:50,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-10-20 06:43:50,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:50,897 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:43:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-10-20 06:43:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-20 06:43:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 06:43:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-10-20 06:43:50,901 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:43:50,901 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:43:50,901 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:43:50,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-10-20 06:43:50,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:50,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:50,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:50,903 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:43:50,903 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:50,904 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 164#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 165#L28-3 [2020-10-20 06:43:50,904 INFO L796 eck$LassoCheckResult]: Loop: 165#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 172#L28-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 166#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 167#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 168#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 169#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 167#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 168#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 169#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 167#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 168#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 170#recFINAL assume true; 173#recEXIT >#31#return; 174#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 175#recFINAL assume true; 176#recEXIT >#31#return; 179#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 180#recFINAL assume true; 178#recEXIT >#33#return; 177#L31-1 havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 165#L28-3 [2020-10-20 06:43:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2020-10-20 06:43:50,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:50,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276476590] [2020-10-20 06:43:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:50,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:50,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:50,924 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2020-10-20 06:43:50,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:50,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129642974] [2020-10-20 06:43:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:43:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:43:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:43:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 06:43:51,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129642974] [2020-10-20 06:43:51,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836408611] [2020-10-20 06:43:51,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:43:51,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:43:51,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:43:51,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 06:43:51,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:51,337 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 28 [2020-10-20 06:43:51,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:43:51,356 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 06:43:51,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:43:51,387 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-20 06:43:51,388 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2020-10-20 06:43:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 06:43:51,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:43:51,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-10-20 06:43:51,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098442964] [2020-10-20 06:43:51,510 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:43:51,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 06:43:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-10-20 06:43:51,512 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 14 states. [2020-10-20 06:43:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:51,680 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-10-20 06:43:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:43:51,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-10-20 06:43:51,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:51,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2020-10-20 06:43:51,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 06:43:51,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 06:43:51,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-20 06:43:51,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:51,689 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:43:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-20 06:43:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 06:43:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 06:43:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-10-20 06:43:51,694 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:43:51,694 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:43:51,694 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:43:51,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-10-20 06:43:51,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:43:51,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:51,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:51,696 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:43:51,697 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:51,697 INFO L794 eck$LassoCheckResult]: Stem: 320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 318#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 319#L28-3 [2020-10-20 06:43:51,697 INFO L796 eck$LassoCheckResult]: Loop: 319#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 321#L28-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 313#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 314#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 315#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 316#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 314#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 315#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 316#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 314#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 315#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 316#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 314#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 315#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 317#recFINAL assume true; 322#recEXIT >#31#return; 323#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 325#recFINAL assume true; 332#recEXIT >#31#return; 331#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 330#recFINAL assume true; 329#recEXIT >#31#return; 327#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 328#recFINAL assume true; 326#recEXIT >#33#return; 324#L31-1 havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 319#L28-3 [2020-10-20 06:43:51,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2020-10-20 06:43:51,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:51,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101430408] [2020-10-20 06:43:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,713 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2020-10-20 06:43:51,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:51,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641730468] [2020-10-20 06:43:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,756 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,818 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:51,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2020-10-20 06:43:51,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:51,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528411784] [2020-10-20 06:43:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,969 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:52,366 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-10-20 06:43:52,898 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2020-10-20 06:43:53,131 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-20 06:43:53,665 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 119 [2020-10-20 06:43:53,848 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-20 06:43:54,014 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-20 06:43:54,224 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-20 06:43:54,998 WARN L193 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-20 06:43:55,543 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-20 06:43:55,690 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-10-20 06:43:55,779 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:55,779 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:55,779 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:55,780 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:55,780 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:55,780 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:55,780 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:55,780 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:55,780 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2020-10-20 06:43:55,780 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:55,780 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:55,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:55,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:56,002 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-10-20 06:43:56,061 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) 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:382) 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:320) 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-10-20 06:43:56,068 INFO L168 Benchmark]: Toolchain (without parser) took 8148.39 ms. Allocated memory was 43.0 MB in the beginning and 81.8 MB in the end (delta: 38.8 MB). Free memory was 21.4 MB in the beginning and 46.1 MB in the end (delta: -24.7 MB). Peak memory consumption was 52.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:56,072 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 32.0 MB. Free memory was 9.0 MB in the beginning and 9.0 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. [2020-10-20 06:43:56,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.00 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 20.5 MB in the beginning and 21.7 MB in the end (delta: -1.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:56,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 43.5 MB. Free memory was 21.6 MB in the beginning and 20.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:56,076 INFO L168 Benchmark]: Boogie Preprocessor took 54.00 ms. Allocated memory is still 43.5 MB. Free memory was 20.0 MB in the beginning and 18.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:56,079 INFO L168 Benchmark]: RCFGBuilder took 307.99 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 18.7 MB in the beginning and 20.9 MB in the end (delta: -2.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:56,080 INFO L168 Benchmark]: BuchiAutomizer took 7418.00 ms. Allocated memory was 45.1 MB in the beginning and 81.8 MB in the end (delta: 36.7 MB). Free memory was 20.7 MB in the beginning and 46.1 MB in the end (delta: -25.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:43:56,091 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 32.0 MB. Free memory was 9.0 MB in the beginning and 9.0 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 314.00 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 20.5 MB in the beginning and 21.7 MB in the end (delta: -1.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 43.5 MB. Free memory was 21.6 MB in the beginning and 20.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 54.00 ms. Allocated memory is still 43.5 MB. Free memory was 20.0 MB in the beginning and 18.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 307.99 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 18.7 MB in the beginning and 20.9 MB in the end (delta: -2.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 7418.00 ms. Allocated memory was 45.1 MB in the beginning and 81.8 MB in the end (delta: 36.7 MB). Free memory was 20.7 MB in the beginning and 46.1 MB in the end (delta: -25.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...