./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 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../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-906a4fb [2020-10-19 18:50:46,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:50:46,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:50:46,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:50:46,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:50:46,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:50:46,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:50:46,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:50:46,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:50:46,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:50:46,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:50:46,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:50:46,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:50:46,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:50:46,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:50:46,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:50:46,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:50:46,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:50:46,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:50:46,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:50:46,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:50:46,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:50:46,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:50:46,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:50:46,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:50:46,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:50:46,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:50:46,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:50:46,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:50:46,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:50:46,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:50:46,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:50:46,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:50:46,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:50:46,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:50:46,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:50:46,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:50:46,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:50:46,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:50:46,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:50:46,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:50:46,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:50:47,021 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:50:47,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:50:47,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:50:47,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:50:47,026 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:50:47,027 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:50:47,027 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:50:47,027 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:50:47,027 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:50:47,028 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:50:47,028 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:50:47,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:50:47,029 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:50:47,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:50:47,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:50:47,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:50:47,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:50:47,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:50:47,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:50:47,031 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:50:47,031 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:50:47,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:50:47,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:50:47,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:50:47,032 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:50:47,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:50:47,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:50:47,033 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:50:47,033 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:50:47,034 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:50:47,035 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-19 18:50:47,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:50:47,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:50:47,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:50:47,447 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:50:47,448 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:50:47,450 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-19 18:50:47,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2109ca028/78596689b1df4ddd8fe398f9483841ea/FLAG3eba8846f [2020-10-19 18:50:47,980 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:50:47,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2020-10-19 18:50:47,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2109ca028/78596689b1df4ddd8fe398f9483841ea/FLAG3eba8846f [2020-10-19 18:50:48,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2109ca028/78596689b1df4ddd8fe398f9483841ea [2020-10-19 18:50:48,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:50:48,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:50:48,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:48,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:50:48,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:50:48,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2769fcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48, skipping insertion in model container [2020-10-19 18:50:48,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:50:48,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:50:48,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:48,597 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:50:48,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:48,632 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:50:48,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48 WrapperNode [2020-10-19 18:50:48,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:48,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:48,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:50:48,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:50:48,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:48,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:50:48,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:50:48,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:50:48,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (1/1) ... [2020-10-19 18:50:48,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:50:48,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:50:48,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:50:48,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:50:48,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50: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-19 18:50:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:50:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2020-10-19 18:50:48,819 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2020-10-19 18:50:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 18:50:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:50:48,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:50:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:50:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:50:49,155 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:50:49,155 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-19 18:50:49,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:49 BoogieIcfgContainer [2020-10-19 18:50:49,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:50:49,158 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:50:49,158 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:50:49,162 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:50:49,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:49,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:50:48" (1/3) ... [2020-10-19 18:50:49,164 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ddb8341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:49, skipping insertion in model container [2020-10-19 18:50:49,164 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:49,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:48" (2/3) ... [2020-10-19 18:50:49,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ddb8341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:49, skipping insertion in model container [2020-10-19 18:50:49,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:49,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:49" (3/3) ... [2020-10-19 18:50:49,167 INFO L373 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2020-10-19 18:50:49,216 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:50:49,216 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:50:49,217 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:50:49,217 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:50:49,217 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:50:49,217 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:50:49,218 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:50:49,218 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:50:49,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-19 18:50:49,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:49,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:49,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:49,271 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:50:49,271 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:49,271 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:50:49,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-19 18:50:49,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:49,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:49,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:49,274 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:50:49,274 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:49,282 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-19 18:50:49,282 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-19 18:50:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2020-10-19 18:50:49,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680354827] [2020-10-19 18:50:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,453 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2020-10-19 18:50:49,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351658290] [2020-10-19 18:50:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,539 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2020-10-19 18:50:49,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053677694] [2020-10-19 18:50:49,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:49,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-19 18:50:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:49,783 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-19 18:50:49,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053677694] [2020-10-19 18:50:49,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:49,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-19 18:50:49,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444837147] [2020-10-19 18:50:50,355 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2020-10-19 18:50:50,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 18:50:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-19 18:50:50,452 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 8 states. [2020-10-19 18:50:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:50,587 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-10-19 18:50:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 18:50:50,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2020-10-19 18:50:50,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:50,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2020-10-19 18:50:50,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:50:50,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 18:50:50,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2020-10-19 18:50:50,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:50,608 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-19 18:50:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2020-10-19 18:50:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-19 18:50:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 18:50:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-10-19 18:50:50,645 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-19 18:50:50,646 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-19 18:50:50,646 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:50:50,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-10-19 18:50:50,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:50,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:50,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:50,649 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:50:50,649 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:50,650 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-19 18:50:50,650 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-19 18:50:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2020-10-19 18:50:50,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062751853] [2020-10-19 18:50:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,680 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,681 INFO L82 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2020-10-19 18:50:50,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136907108] [2020-10-19 18:50:50,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:50,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:50:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:50,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:50:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:50,885 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-19 18:50:50,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136907108] [2020-10-19 18:50:50,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101265233] [2020-10-19 18:50:50,887 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-19 18:50:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:50,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 18:50:50,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:51,111 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-19 18:50:51,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:50:51,120 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-19 18:50:51,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:50:51,148 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-19 18:50:51,151 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2020-10-19 18:50:51,205 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-19 18:50:51,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:50:51,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2020-10-19 18:50:51,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747261062] [2020-10-19 18:50:51,208 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:50:51,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 18:50:51,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-19 18:50:51,214 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-10-19 18:50:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:51,377 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-10-19 18:50:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 18:50:51,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-10-19 18:50:51,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:51,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-10-19 18:50:51,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 18:50:51,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 18:50:51,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-10-19 18:50:51,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:51,388 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-19 18:50:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-10-19 18:50:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-19 18:50:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 18:50:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-10-19 18:50:51,398 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-19 18:50:51,398 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-19 18:50:51,400 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:50:51,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-10-19 18:50:51,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:51,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:51,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:51,404 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:50:51,405 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:51,406 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-19 18:50:51,406 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-19 18:50:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2020-10-19 18:50:51,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:51,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108607679] [2020-10-19 18:50:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:51,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:51,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:51,451 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2020-10-19 18:50:51,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:51,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477371438] [2020-10-19 18:50:51,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:51,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:50:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:51,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:50:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:51,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:50:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:51,654 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-19 18:50:51,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477371438] [2020-10-19 18:50:51,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588260289] [2020-10-19 18:50:51,656 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-19 18:50:51,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:50:51,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:50:51,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-19 18:50:51,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:51,750 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-19 18:50:51,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:50:51,755 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-19 18:50:51,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:50:51,777 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-19 18:50:51,778 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2020-10-19 18:50:51,848 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-19 18:50:51,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:50:51,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-10-19 18:50:51,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549388609] [2020-10-19 18:50:51,850 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:50:51,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-19 18:50:51,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-10-19 18:50:51,852 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 14 states. [2020-10-19 18:50:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:52,024 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-10-19 18:50:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 18:50:52,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-10-19 18:50:52,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:52,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2020-10-19 18:50:52,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-19 18:50:52,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-19 18:50:52,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-19 18:50:52,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:52,029 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-19 18:50:52,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-19 18:50:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-19 18:50:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 18:50:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-10-19 18:50:52,038 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-19 18:50:52,038 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-19 18:50:52,038 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:50:52,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-10-19 18:50:52,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 18:50:52,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:52,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:52,043 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:50:52,044 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:52,045 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-19 18:50:52,046 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-19 18:50:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2020-10-19 18:50:52,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:52,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134105783] [2020-10-19 18:50:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,073 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2020-10-19 18:50:52,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:52,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445834732] [2020-10-19 18:50:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,164 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,173 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2020-10-19 18:50:52,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:52,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044269895] [2020-10-19 18:50:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,265 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:52,678 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-10-19 18:50:53,265 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2020-10-19 18:50:53,479 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-19 18:50:54,034 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 119 [2020-10-19 18:50:54,196 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-19 18:50:54,349 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-19 18:50:54,515 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 18:50:55,259 WARN L193 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-19 18:50:55,742 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-19 18:50:55,907 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-10-19 18:50:56,018 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:56,019 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:56,019 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:56,019 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:56,019 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:56,019 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,019 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:56,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:56,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2020-10-19 18:50:56,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:56,020 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:56,039 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-19 18:50:56,044 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-19 18:50:56,048 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-19 18:50:56,051 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-19 18:50:56,054 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-19 18:50:56,057 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-19 18:50:56,060 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-19 18:50:56,063 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-19 18:50:56,065 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-19 18:50:56,068 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-19 18:50:56,246 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-10-19 18:50:56,313 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-19 18:50:56,318 INFO L168 Benchmark]: Toolchain (without parser) took 7955.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.7 MB). Free memory was 953.2 MB in the beginning and 1.2 GB in the end (delta: -242.9 MB). Peak memory consumption was 402.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:56,319 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:50:56,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.31 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:56,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -117.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:56,321 INFO L168 Benchmark]: Boogie Preprocessor took 24.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:56,322 INFO L168 Benchmark]: RCFGBuilder took 402.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:56,323 INFO L168 Benchmark]: BuchiAutomizer took 7158.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.4 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:56,328 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.31 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.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 96.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -117.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 402.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7158.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.4 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 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...