./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 30f4e4ab 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: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:04:22,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:04:22,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:04:22,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:04:22,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:04:22,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:04:22,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:04:22,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:04:22,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:04:22,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:04:22,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:04:22,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:04:22,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:04:22,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:04:22,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:04:22,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:04:22,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:04:22,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:04:22,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:04:22,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:04:22,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:04:22,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:04:22,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:04:22,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:04:22,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:04:22,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:04:22,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:04:22,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:04:22,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:04:22,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:04:22,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:04:22,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:04:22,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:04:22,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:04:22,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:04:22,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:04:22,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:04:22,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:04:22,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:04:22,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:04:22,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:04:22,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:04:22,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:04:22,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:04:22,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:04:22,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:04:22,303 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:04:22,303 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:04:22,304 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:04:22,304 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:04:22,304 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:04:22,304 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:04:22,305 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:04:22,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:04:22,305 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:04:22,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:04:22,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:04:22,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:04:22,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:04:22,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:04:22,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:04:22,307 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:04:22,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:04:22,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:04:22,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:04:22,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:04:22,308 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:04:22,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:04:22,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:04:22,309 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:04:22,310 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:04:22,310 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 [2019-11-28 03:04:22,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:04:22,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:04:22,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:04:22,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:04:22,633 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:04:22,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2019-11-28 03:04:22,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d463f2a82/9587bf0ec8cf4ab3972b78d4b7f6987c/FLAG11e0cb7e0 [2019-11-28 03:04:23,113 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:04:23,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2019-11-28 03:04:23,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d463f2a82/9587bf0ec8cf4ab3972b78d4b7f6987c/FLAG11e0cb7e0 [2019-11-28 03:04:23,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d463f2a82/9587bf0ec8cf4ab3972b78d4b7f6987c [2019-11-28 03:04:23,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:04:23,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:04:23,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:23,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:04:23,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:04:23,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e246e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23, skipping insertion in model container [2019-11-28 03:04:23,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:04:23,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:04:23,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:23,785 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:04:23,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:23,832 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:04:23,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23 WrapperNode [2019-11-28 03:04:23,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:23,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:23,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:04:23,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:04:23,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:23,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:04:23,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:04:23,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:04:23,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (1/1) ... [2019-11-28 03:04:23,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:04:23,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:04:23,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:04:23,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:04:24,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (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 [2019-11-28 03:04:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:04:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-28 03:04:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-28 03:04:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:04:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:04:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:04:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:04:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:04:24,285 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:04:24,285 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:04:24,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:24 BoogieIcfgContainer [2019-11-28 03:04:24,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:04:24,287 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:04:24,287 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:04:24,291 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:04:24,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:24,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:04:23" (1/3) ... [2019-11-28 03:04:24,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@260a1677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:24, skipping insertion in model container [2019-11-28 03:04:24,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:24,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:23" (2/3) ... [2019-11-28 03:04:24,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@260a1677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:24, skipping insertion in model container [2019-11-28 03:04:24,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:24,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:24" (3/3) ... [2019-11-28 03:04:24,296 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2019-11-28 03:04:24,354 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:04:24,354 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:04:24,355 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:04:24,355 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:04:24,355 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:04:24,355 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:04:24,356 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:04:24,356 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:04:24,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 03:04:24,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:24,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:24,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:24,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:24,423 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:24,423 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:04:24,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 03:04:24,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:24,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:24,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:24,429 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:24,430 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:24,439 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 [2019-11-28 03:04:24,440 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 [2019-11-28 03:04:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-28 03:04:24,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:24,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625266491] [2019-11-28 03:04:24,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:24,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2019-11-28 03:04:24,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:24,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613723432] [2019-11-28 03:04:24,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:24,672 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:24,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2019-11-28 03:04:24,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:24,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132020893] [2019-11-28 03:04:24,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:24,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132020893] [2019-11-28 03:04:24,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:04:24,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 03:04:24,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416493572] [2019-11-28 03:04:25,451 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-11-28 03:04:25,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:25,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:04:25,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:04:25,551 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 8 states. [2019-11-28 03:04:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:25,694 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-28 03:04:25,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:04:25,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-28 03:04:25,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:25,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2019-11-28 03:04:25,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:04:25,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:04:25,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-28 03:04:25,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:25,710 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 03:04:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-28 03:04:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 03:04:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 03:04:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-28 03:04:25,739 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 03:04:25,739 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 03:04:25,740 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:04:25,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-28 03:04:25,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:25,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:25,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:25,742 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:25,743 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:25,743 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 58#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; 59#L28-3 [2019-11-28 03:04:25,743 INFO L796 eck$LassoCheckResult]: Loop: 59#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 66#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); 60#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 61#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 62#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; 63#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 61#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 62#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; 64#recFINAL assume true; 67#recEXIT >#31#return; 68#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 70#recFINAL assume true; 71#recEXIT >#33#return; 69#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; 59#L28-3 [2019-11-28 03:04:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:25,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-28 03:04:25,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:25,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144757353] [2019-11-28 03:04:25,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:25,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:25,770 INFO L82 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2019-11-28 03:04:25,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:25,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350182599] [2019-11-28 03:04:25,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 03:04:25,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350182599] [2019-11-28 03:04:25,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344914749] [2019-11-28 03:04:25,987 INFO L94 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 [2019-11-28 03:04:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:26,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 03:04:26,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:26,178 INFO L377 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 [2019-11-28 03:04:26,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:26,185 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 03:04:26,205 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:26,206 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 03:04:26,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2019-11-28 03:04:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:04:26,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:04:26,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2019-11-28 03:04:26,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333267326] [2019-11-28 03:04:26,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:04:26,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:26,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 03:04:26,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 03:04:26,263 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-28 03:04:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:26,413 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-28 03:04:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:04:26,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-28 03:04:26,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:26,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-28 03:04:26,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:04:26,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:04:26,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-28 03:04:26,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:26,420 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 03:04:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-28 03:04:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:04:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:04:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-28 03:04:26,426 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 03:04:26,426 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 03:04:26,426 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:04:26,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-28 03:04:26,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:26,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:26,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:26,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:26,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:26,431 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 163#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; 164#L28-3 [2019-11-28 03:04:26,431 INFO L796 eck$LassoCheckResult]: Loop: 164#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 171#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); 165#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 166#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 167#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; 168#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 166#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 167#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; 168#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 166#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 167#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; 169#recFINAL assume true; 172#recEXIT >#31#return; 173#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 174#recFINAL assume true; 175#recEXIT >#31#return; 178#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 179#recFINAL assume true; 177#recEXIT >#33#return; 176#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; 164#L28-3 [2019-11-28 03:04:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-11-28 03:04:26,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:26,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928164791] [2019-11-28 03:04:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:26,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2019-11-28 03:04:26,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:26,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983211534] [2019-11-28 03:04:26,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:04:26,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983211534] [2019-11-28 03:04:26,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103426650] [2019-11-28 03:04:26,760 INFO L92 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 [2019-11-28 03:04:26,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:04:26,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:04:26,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 03:04:26,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:26,862 INFO L377 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 [2019-11-28 03:04:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:26,864 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 03:04:26,883 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:26,884 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 03:04:26,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2019-11-28 03:04:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:04:26,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:04:26,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2019-11-28 03:04:26,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707948248] [2019-11-28 03:04:26,938 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:04:26,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 03:04:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 03:04:26,940 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-28 03:04:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:27,124 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-28 03:04:27,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:04:27,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-28 03:04:27,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:27,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-28 03:04:27,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:04:27,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:04:27,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-28 03:04:27,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:27,129 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 03:04:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-28 03:04:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 03:04:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:04:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-28 03:04:27,133 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 03:04:27,133 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 03:04:27,133 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:04:27,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-28 03:04:27,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:04:27,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:27,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:27,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:27,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:27,136 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 315#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; 316#L28-3 [2019-11-28 03:04:27,137 INFO L796 eck$LassoCheckResult]: Loop: 316#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 319#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); 312#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 317#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 311#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; 313#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 317#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 311#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; 313#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 317#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 311#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; 313#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 317#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 311#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; 314#recFINAL assume true; 320#recEXIT >#31#return; 321#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 323#recFINAL assume true; 330#recEXIT >#31#return; 329#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 328#recFINAL assume true; 327#recEXIT >#31#return; 325#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 326#recFINAL assume true; 324#recEXIT >#33#return; 322#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; 316#L28-3 [2019-11-28 03:04:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2019-11-28 03:04:27,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:27,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862664640] [2019-11-28 03:04:27,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:27,151 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2019-11-28 03:04:27,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:27,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876963295] [2019-11-28 03:04:27,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:27,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2019-11-28 03:04:27,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:27,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385970080] [2019-11-28 03:04:27,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:27,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:27,636 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-28 03:04:28,118 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-11-28 03:04:28,315 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-28 03:04:28,821 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2019-11-28 03:04:28,931 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-28 03:04:29,121 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:04:29,273 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-28 03:04:30,104 WARN L192 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2019-11-28 03:04:30,391 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:04:30,538 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-11-28 03:04:30,618 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:04:30,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:04:30,619 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:04:30,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:04:30,619 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:04:30,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:30,620 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:04:30,620 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:04:30,620 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2019-11-28 03:04:30,620 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:04:30,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:04:30,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:30,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:30,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:30,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:30,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:30,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:30,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:30,850 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-11-28 03:04:31,181 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-11-28 03:04:31,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:31,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:31,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:31,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:31,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:31,627 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-28 03:04:31,953 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-28 03:04:32,071 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:32,076 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:32,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:32,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:32,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:32,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:32,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:32,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:32,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:32,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:32,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:32,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:32,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:32,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:32,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:32,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:32,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:32,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:32,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:32,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:32,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:32,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:32,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:32,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:32,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:32,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:32,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,271 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-28 03:04:32,271 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2019-11-28 03:04:32,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,422 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2019-11-28 03:04:32,422 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-11-28 03:04:32,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:32,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:32,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:32,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:32,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:32,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:32,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:32,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:32,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:32,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:32,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:32,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:32,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:32,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:32,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:32,983 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:04:32,983 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:33,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:04:33,043 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:04:33,044 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:33,045 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-11-28 03:04:33,111 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-28 03:04:33,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:04:33,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:33,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:04:33,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:33,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-28 03:04:33,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:33,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:33,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2019-11-28 03:04:33,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:33,374 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:33,554 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-28 03:04:33,555 INFO L588 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2019-11-28 03:04:33,556 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:33,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:51 [2019-11-28 03:04:34,818 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-28 03:04:47,004 WARN L192 SmtUtils]: Spent 12.09 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-28 03:04:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:47,502 INFO L404 ElimStorePlain]: Different costs {9=[v_prenex_17], 13=[|v_#valid_BEFORE_CALL_6|]} [2019-11-28 03:04:47,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:47,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 73 [2019-11-28 03:04:47,606 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:47,778 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:04:47,779 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:47,921 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:47,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 108 [2019-11-28 03:04:47,923 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:48,176 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-28 03:04:48,176 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,179 INFO L404 ElimStorePlain]: Different costs {8=[v_prenex_6], 18=[|v_old(#memory_int)_AFTER_CALL_9|]} [2019-11-28 03:04:48,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 96 [2019-11-28 03:04:48,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:48,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2019-11-28 03:04:48,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:48,255 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_17, v_arrayElimCell_15, v_arrayElimCell_16], 1=[v_arrayElimCell_14]} [2019-11-28 03:04:48,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-28 03:04:48,269 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:48,290 INFO L588 ElimStorePlain]: treesize reduction 19, result has 64.2 percent of original size [2019-11-28 03:04:48,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 03:04:48,301 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:48,309 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 03:04:48,321 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:48,328 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-11-28 03:04:48,345 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-28 03:04:48,365 INFO L588 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2019-11-28 03:04:48,365 INFO L508 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:48,383 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,384 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:48,509 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-28 03:04:48,510 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 131 [2019-11-28 03:04:48,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:48,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:04:48,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:48,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 70 [2019-11-28 03:04:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:48,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:48,599 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_28, v_arrayElimCell_26, v_arrayElimCell_27, v_arrayElimCell_25], 1=[v_arrayElimCell_24]} [2019-11-28 03:04:48,612 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.constructTraceCheck(RefineBuchi.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:208) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) 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) [2019-11-28 03:04:48,616 INFO L168 Benchmark]: Toolchain (without parser) took 25097.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -190.3 MB). Peak memory consumption was 134.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:48,617 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:04:48,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:48,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -205.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:48,621 INFO L168 Benchmark]: Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:04:48,626 INFO L168 Benchmark]: RCFGBuilder took 288.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:48,627 INFO L168 Benchmark]: BuchiAutomizer took 24326.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -14.8 MB). Peak memory consumption was 138.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:48,634 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 140.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -205.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 288.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24326.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -14.8 MB). Peak memory consumption was 138.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...