./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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_ex2.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 205669a0469477740fa35099dd0e4ee1e635b686 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:36:59,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:36:59,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:36:59,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:36:59,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:36:59,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:36:59,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:36:59,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:36:59,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:36:59,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:36:59,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:36:59,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:36:59,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:36:59,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:36:59,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:36:59,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:36:59,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:36:59,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:36:59,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:36:59,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:36:59,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:36:59,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:36:59,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:36:59,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:36:59,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:36:59,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:36:59,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:36:59,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:36:59,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:36:59,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:36:59,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:36:59,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:36:59,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:36:59,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:36:59,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:36:59,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:36:59,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:36:59,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:36:59,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:36:59,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:36:59,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:36:59,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:36:59,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:36:59,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:36:59,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:36:59,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:36:59,822 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:36:59,822 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:36:59,822 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:36:59,823 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:36:59,823 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:36:59,823 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:36:59,823 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:36:59,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:36:59,824 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:36:59,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:36:59,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:36:59,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:36:59,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:36:59,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:36:59,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:36:59,826 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:36:59,826 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:36:59,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:36:59,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:36:59,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:36:59,827 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:36:59,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:36:59,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:36:59,828 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:36:59,828 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:36:59,829 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:36:59,830 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 -> 205669a0469477740fa35099dd0e4ee1e635b686 [2019-11-28 20:37:00,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:37:00,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:37:00,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:37:00,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:37:00,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:37:00,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-11-28 20:37:00,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77dae43d7/358fd58dd80a424d9ae1204aab5581e5/FLAGe27b5e7db [2019-11-28 20:37:00,707 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:37:00,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-11-28 20:37:00,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77dae43d7/358fd58dd80a424d9ae1204aab5581e5/FLAGe27b5e7db [2019-11-28 20:37:01,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77dae43d7/358fd58dd80a424d9ae1204aab5581e5 [2019-11-28 20:37:01,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:37:01,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:37:01,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:37:01,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:37:01,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:37:01,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a3f223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01, skipping insertion in model container [2019-11-28 20:37:01,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:37:01,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:37:01,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:37:01,322 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:37:01,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:37:01,350 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:37:01,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01 WrapperNode [2019-11-28 20:37:01,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:37:01,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:37:01,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:37:01,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:37:01,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:37:01,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:37:01,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:37:01,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:37:01,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (1/1) ... [2019-11-28 20:37:01,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:37:01,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:37:01,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:37:01,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:37:01,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (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 20:37:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:37:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-28 20:37:01,547 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-28 20:37:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:37:01,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:37:01,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:37:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:37:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:37:01,784 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:37:01,785 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:37:01,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:01 BoogieIcfgContainer [2019-11-28 20:37:01,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:37:01,788 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:37:01,788 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:37:01,794 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:37:01,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:37:01,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:37:01" (1/3) ... [2019-11-28 20:37:01,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a65ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:37:01, skipping insertion in model container [2019-11-28 20:37:01,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:37:01,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:01" (2/3) ... [2019-11-28 20:37:01,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a65ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:37:01, skipping insertion in model container [2019-11-28 20:37:01,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:37:01,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:01" (3/3) ... [2019-11-28 20:37:01,812 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2019-11-28 20:37:01,874 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:37:01,875 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:37:01,875 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:37:01,875 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:37:01,875 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:37:01,876 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:37:01,876 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:37:01,876 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:37:01,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:37:01,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:01,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:01,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:01,920 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:37:01,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:01,921 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:37:01,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:37:01,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:01,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:01,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:01,924 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:37:01,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:01,930 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 7#L23-3true [2019-11-28 20:37:01,931 INFO L796 eck$LassoCheckResult]: Loop: 7#L23-3true call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 12#L23-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 3#L26true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 17#L26-1true call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 7#L23-3true [2019-11-28 20:37:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-28 20:37:01,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:01,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386960522] [2019-11-28 20:37:01,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:02,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2019-11-28 20:37:02,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:02,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661826642] [2019-11-28 20:37:02,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:02,440 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 20:37:02,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661826642] [2019-11-28 20:37:02,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:37:02,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:37:02,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977351159] [2019-11-28 20:37:02,448 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:37:02,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:37:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:37:02,464 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 20:37:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:02,603 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-28 20:37:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:37:02,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-28 20:37:02,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:02,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2019-11-28 20:37:02,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:37:02,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:37:02,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-28 20:37:02,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:02,622 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 20:37:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-28 20:37:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 20:37:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 20:37:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-28 20:37:02,656 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 20:37:02,656 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 20:37:02,656 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:37:02,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-28 20:37:02,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:02,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:02,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:02,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:37:02,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:02,660 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 51#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 52#L23-3 [2019-11-28 20:37:02,661 INFO L796 eck$LassoCheckResult]: Loop: 52#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 59#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 54#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 55#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 56#recFINAL assume true; 60#recEXIT >#29#return; 61#L17-1 #res := #t~ret6;havoc #t~ret6; 62#recFINAL assume true; 64#recEXIT >#31#return; 63#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 52#L23-3 [2019-11-28 20:37:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-28 20:37:02,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:02,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408070867] [2019-11-28 20:37:02,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:02,683 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2019-11-28 20:37:02,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:02,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089440694] [2019-11-28 20:37:02,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:02,958 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 20:37:02,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089440694] [2019-11-28 20:37:02,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485303941] [2019-11-28 20:37:02,959 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 20:37:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:03,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 20:37:03,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:03,142 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-28 20:37:03,143 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 23 treesize of output 18 [2019-11-28 20:37:03,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:03,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:03,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:37:03,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-28 20:37:03,349 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 20:37:03,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:37:03,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-28 20:37:03,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528665943] [2019-11-28 20:37:03,351 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:37:03,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:37:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:37:03,353 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 16 states. [2019-11-28 20:37:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:03,559 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-28 20:37:03,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:37:03,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-28 20:37:03,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:03,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-28 20:37:03,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 20:37:03,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 20:37:03,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-28 20:37:03,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:03,569 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 20:37:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-28 20:37:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 20:37:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:37:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-28 20:37:03,575 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 20:37:03,576 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 20:37:03,576 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:37:03,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-28 20:37:03,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:03,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:03,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:03,582 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:37:03,582 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:03,582 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 160#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 161#L23-3 [2019-11-28 20:37:03,583 INFO L796 eck$LassoCheckResult]: Loop: 161#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 168#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 163#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 165#recFINAL assume true; 169#recEXIT >#29#return; 170#L17-1 #res := #t~ret6;havoc #t~ret6; 171#recFINAL assume true; 176#recEXIT >#29#return; 174#L17-1 #res := #t~ret6;havoc #t~ret6; 175#recFINAL assume true; 173#recEXIT >#31#return; 172#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 161#L23-3 [2019-11-28 20:37:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-11-28 20:37:03,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:03,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370145981] [2019-11-28 20:37:03,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:03,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2019-11-28 20:37:03,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:03,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836685630] [2019-11-28 20:37:03,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 20:37:03,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836685630] [2019-11-28 20:37:03,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969769997] [2019-11-28 20:37:03,922 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 20:37:03,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:37:03,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:37:03,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-28 20:37:03,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:04,040 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-28 20:37:04,041 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 23 treesize of output 18 [2019-11-28 20:37:04,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:04,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:04,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:37:04,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-28 20:37:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:37:04,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:37:04,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-11-28 20:37:04,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537392332] [2019-11-28 20:37:04,292 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:37:04,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:37:04,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:37:04,296 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 19 states. [2019-11-28 20:37:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:04,582 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-28 20:37:04,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:37:04,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-28 20:37:04,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:04,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-28 20:37:04,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 20:37:04,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 20:37:04,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-28 20:37:04,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:04,587 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 20:37:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-28 20:37:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 20:37:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:37:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-28 20:37:04,590 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 20:37:04,591 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 20:37:04,591 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:37:04,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-28 20:37:04,592 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:37:04,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:04,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:04,593 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:37:04,593 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:04,594 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 316#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 317#L23-3 [2019-11-28 20:37:04,594 INFO L796 eck$LassoCheckResult]: Loop: 317#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 320#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 313#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 315#recFINAL assume true; 331#recEXIT >#29#return; 324#L17-1 #res := #t~ret6;havoc #t~ret6; 323#recFINAL assume true; 321#recEXIT >#29#return; 322#L17-1 #res := #t~ret6;havoc #t~ret6; 330#recFINAL assume true; 329#recEXIT >#29#return; 327#L17-1 #res := #t~ret6;havoc #t~ret6; 328#recFINAL assume true; 326#recEXIT >#31#return; 325#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 317#L23-3 [2019-11-28 20:37:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2019-11-28 20:37:04,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:04,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139110933] [2019-11-28 20:37:04,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:04,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:04,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2019-11-28 20:37:04,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:04,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45006523] [2019-11-28 20:37:04,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:04,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2019-11-28 20:37:04,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:04,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203830013] [2019-11-28 20:37:04,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:04,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:05,406 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-11-28 20:37:06,073 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-11-28 20:37:06,294 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-28 20:37:06,418 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-28 20:37:06,867 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-11-28 20:37:07,116 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-28 20:37:07,248 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 20:37:07,950 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-11-28 20:37:08,138 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 20:37:08,244 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:37:08,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:37:08,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:37:08,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:37:08,245 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:37:08,245 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:08,246 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:37:08,246 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:37:08,246 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration4_Lasso [2019-11-28 20:37:08,246 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:37:08,247 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:37:08,266 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 20:37:08,270 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 20:37:08,272 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 20:37:08,273 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 20:37:08,276 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 20:37:08,596 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-11-28 20:37:08,597 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 20:37:08,599 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 20:37:08,600 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 20:37:08,602 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 20:37:09,677 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-28 20:37:09,759 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:37:09,764 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 20:37:09,776 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 20:37:09,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:09,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:09,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:09,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:09,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:09,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:09,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:09,783 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 20:37:09,792 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 20:37:09,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:09,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:09,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:09,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:09,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:09,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:09,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:09,799 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 20:37:09,805 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 20:37:09,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:09,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:09,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:09,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:09,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:09,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:09,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:09,809 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 20:37:09,816 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 20:37:09,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:09,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:09,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:09,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:09,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:09,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:09,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:09,822 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) [2019-11-28 20:37:09,844 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 20:37:09,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:09,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:09,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:09,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:09,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:09,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:09,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:09,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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:09,867 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 20:37:09,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:09,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:09,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:09,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:09,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:09,878 INFO L402 nArgumentSynthesizer]: A total of 2 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 20:37:09,889 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 20:37:09,904 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 20:37:09,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:09,907 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 20:37:09,907 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2019-11-28 20:37:09,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:10,559 INFO L401 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2019-11-28 20:37:10,560 INFO L402 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2019-11-28 20:37:12,176 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 20:37:12,200 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 20:37:12,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:12,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:12,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:12,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:12,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:12,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:12,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:12,210 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 20:37:12,230 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 20:37:12,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:12,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:12,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:12,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:12,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:12,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:12,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:12,235 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 20:37:12,241 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 20:37:12,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:12,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:12,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:12,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:12,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:12,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:12,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:37:12,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:37:12,270 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 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 20:37:12,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:37:12,283 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:37:12,284 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:37:12,285 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1 Supporting invariants [] [2019-11-28 20:37:12,303 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 20:37:12,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:37:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:12,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:37:12,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:12,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 20:37:12,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:12,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:12,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:37:12,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:12,475 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:12,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:37:12,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:37:12,484 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:12,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:12,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:37:12,489 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-11-28 20:37:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 20:37:12,684 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-28 20:37:12,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-28 20:37:12,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 66 states and 73 transitions. Complement of second has 24 states. [2019-11-28 20:37:12,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:37:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-11-28 20:37:12,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 26 letters. [2019-11-28 20:37:12,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:12,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 28 letters. Loop has 26 letters. [2019-11-28 20:37:12,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:12,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 52 letters. [2019-11-28 20:37:12,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:12,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2019-11-28 20:37:12,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:12,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 35 states and 40 transitions. [2019-11-28 20:37:12,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:37:12,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:37:12,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-11-28 20:37:12,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:37:12,884 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-28 20:37:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-11-28 20:37:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-11-28 20:37:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 20:37:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-28 20:37:12,893 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 20:37:12,893 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 20:37:12,893 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:37:12,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-11-28 20:37:12,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:12,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:12,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:12,896 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:37:12,896 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:37:12,897 INFO L794 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 547#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 548#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 561#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 550#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 556#recENTRY [2019-11-28 20:37:12,897 INFO L796 eck$LassoCheckResult]: Loop: 556#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 549#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 551#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 556#recENTRY [2019-11-28 20:37:12,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:12,897 INFO L82 PathProgramCache]: Analyzing trace with hash 36330294, now seen corresponding path program 1 times [2019-11-28 20:37:12,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:12,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2936736] [2019-11-28 20:37:12,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:12,935 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 1 times [2019-11-28 20:37:12,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:12,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856825428] [2019-11-28 20:37:12,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:12,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash -15969886, now seen corresponding path program 1 times [2019-11-28 20:37:12,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:12,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102640939] [2019-11-28 20:37:12,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:13,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:13,151 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-28 20:37:13,684 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-11-28 20:37:13,802 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 20:37:13,941 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-28 20:37:14,011 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:37:14,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:37:14,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:37:14,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:37:14,012 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:37:14,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:37:14,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:37:14,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration5_Lasso [2019-11-28 20:37:14,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:37:14,013 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:37:14,019 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 20:37:14,032 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 20:37:14,034 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 20:37:14,035 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 20:37:14,036 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 20:37:14,037 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 20:37:14,040 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 20:37:14,043 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 20:37:14,044 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 20:37:14,046 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 20:37:14,047 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 20:37:14,051 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 20:37:14,053 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 20:37:14,196 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-28 20:37:14,312 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 20:37:14,313 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 20:37:14,317 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 20:37:14,319 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 20:37:14,320 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 20:37:14,321 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 20:37:14,324 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 20:37:14,331 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 20:37:14,333 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 20:37:14,334 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 20:37:14,335 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 20:37:14,342 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 20:37:14,344 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 20:37:14,345 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 20:37:14,347 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 20:37:14,349 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 20:37:14,350 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 20:37:14,352 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 20:37:14,354 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 20:37:14,358 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 20:37:14,360 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 20:37:14,362 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 20:37:14,813 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:37:14,813 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:37:14,836 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 20:37:14,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,841 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,856 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 20:37:14,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,863 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 20:37:14,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 20:37:14,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,879 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 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 20:37:14,885 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 20:37:14,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,892 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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,897 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 20:37:14,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,901 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,925 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 20:37:14,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:14,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:14,932 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,951 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 20:37:14,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,956 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,962 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 20:37:14,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,965 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,971 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 20:37:14,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,974 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,984 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 20:37:14,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,988 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:14,995 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 20:37:14,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:14,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:14,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:14,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:14,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:14,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:14,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:14,999 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:15,006 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 20:37:15,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:15,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:15,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:15,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:15,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:15,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:15,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:15,016 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:15,023 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 20:37:15,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:15,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:15,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:15,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:15,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:15,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:15,039 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:15,046 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 20:37:15,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:15,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:15,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:15,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:15,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:15,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:15,062 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:37:15,070 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:37:15,071 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:15,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:37:15,077 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:37:15,077 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:37:15,078 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2019-11-28 20:37:15,086 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 20:37:15,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:37:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:15,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:37:15,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:15,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:37:15,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:15,160 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-28 20:37:15,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:15,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:15,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:37:15,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-28 20:37:15,174 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 20:37:15,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:37:15,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 20:37:15,243 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 14 states. [2019-11-28 20:37:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:37:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-28 20:37:15,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 20:37:15,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:15,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 20:37:15,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:15,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:37:15,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:15,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-11-28 20:37:15,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:15,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2019-11-28 20:37:15,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:37:15,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:37:15,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2019-11-28 20:37:15,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:37:15,250 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-28 20:37:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2019-11-28 20:37:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 20:37:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:37:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-28 20:37:15,255 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-28 20:37:15,255 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-28 20:37:15,255 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:37:15,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2019-11-28 20:37:15,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:15,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:15,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:15,258 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:37:15,258 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:37:15,258 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 710#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 711#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 727#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 729#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 743#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 742#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 722#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 736#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 737#recFINAL assume true; 741#recEXIT >#29#return; 719#L17-1 #res := #t~ret6;havoc #t~ret6; 724#recFINAL assume true; 735#recEXIT >#29#return; 733#L17-1 #res := #t~ret6;havoc #t~ret6; 734#recFINAL assume true; 732#recEXIT >#29#return; 731#L17-1 #res := #t~ret6;havoc #t~ret6; 730#recFINAL assume true; 728#recEXIT >#31#return; 725#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 726#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 715#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 706#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 712#recENTRY [2019-11-28 20:37:15,258 INFO L796 eck$LassoCheckResult]: Loop: 712#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 704#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 705#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 712#recENTRY [2019-11-28 20:37:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 770731142, now seen corresponding path program 2 times [2019-11-28 20:37:15,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:15,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015084066] [2019-11-28 20:37:15,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:37:15,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015084066] [2019-11-28 20:37:15,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352931569] [2019-11-28 20:37:15,611 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:37:15,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:37:15,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:37:15,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-28 20:37:15,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:15,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:37:15,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:15,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:15,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:37:15,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-28 20:37:15,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:15,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:37:15,717 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:15,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:15,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2019-11-28 20:37:15,734 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:15,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:15,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:37:15,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2019-11-28 20:37:16,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-28 20:37:16,170 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:16,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:16,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:37:16,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:41 [2019-11-28 20:37:16,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2019-11-28 20:37:16,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:16,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:16,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:37:16,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:29 [2019-11-28 20:37:16,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-28 20:37:16,306 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:37:16,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:16,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:37:16,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:14 [2019-11-28 20:37:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:37:16,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:37:16,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-28 20:37:16,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012782263] [2019-11-28 20:37:16,331 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:37:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 2 times [2019-11-28 20:37:16,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:16,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287378112] [2019-11-28 20:37:16,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:16,342 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:16,502 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-28 20:37:16,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:16,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 20:37:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:37:16,731 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 32 states. [2019-11-28 20:37:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:17,206 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-28 20:37:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 20:37:17,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-11-28 20:37:17,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:17,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2019-11-28 20:37:17,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:37:17,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:37:17,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-28 20:37:17,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:37:17,212 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 20:37:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-28 20:37:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-28 20:37:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:37:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-11-28 20:37:17,218 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-28 20:37:17,218 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-28 20:37:17,219 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:37:17,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-11-28 20:37:17,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:17,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:17,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:17,221 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:37:17,221 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:37:17,222 INFO L794 eck$LassoCheckResult]: Stem: 1004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 995#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 996#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1006#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 998#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 999#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1021#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 992#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 991#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 994#recFINAL assume true; 1009#recEXIT >#29#return; 1010#L17-1 #res := #t~ret6;havoc #t~ret6; 1011#recFINAL assume true; 1007#recEXIT >#29#return; 1008#L17-1 #res := #t~ret6;havoc #t~ret6; 1026#recFINAL assume true; 1024#recEXIT >#29#return; 1020#L17-1 #res := #t~ret6;havoc #t~ret6; 1022#recFINAL assume true; 1019#recEXIT >#29#return; 1018#L17-1 #res := #t~ret6;havoc #t~ret6; 1017#recFINAL assume true; 1015#recEXIT >#31#return; 1012#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 1013#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1005#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 990#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 997#recENTRY [2019-11-28 20:37:17,222 INFO L796 eck$LassoCheckResult]: Loop: 997#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 988#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 989#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 997#recENTRY [2019-11-28 20:37:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1655830132, now seen corresponding path program 3 times [2019-11-28 20:37:17,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:17,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704258474] [2019-11-28 20:37:17,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:17,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 3 times [2019-11-28 20:37:17,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:17,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468694624] [2019-11-28 20:37:17,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:17,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:17,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1136068004, now seen corresponding path program 4 times [2019-11-28 20:37:17,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:17,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956992657] [2019-11-28 20:37:17,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:17,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:17,638 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-28 20:37:18,240 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-11-28 20:37:18,837 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-11-28 20:37:19,045 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-28 20:37:19,157 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-28 20:37:19,621 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-11-28 20:37:19,870 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-28 20:37:19,996 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 20:37:20,609 WARN L192 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-11-28 20:37:20,738 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 20:37:20,926 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-28 20:37:21,116 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-28 20:37:23,242 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 243 DAG size of output: 210 [2019-11-28 20:37:23,801 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-28 20:37:24,282 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-28 20:37:24,594 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-28 20:37:24,598 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:37:24,598 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:37:24,598 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:37:24,598 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:37:24,598 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:37:24,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:24,599 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:37:24,599 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:37:24,599 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration7_Lasso [2019-11-28 20:37:24,599 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:37:24,599 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:37:24,602 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 20:37:24,610 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 20:37:24,612 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 20:37:24,614 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 20:37:24,615 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 20:37:24,618 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 20:37:24,619 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 20:37:24,621 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 20:37:24,927 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-28 20:37:24,995 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 20:37:24,997 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 20:37:24,999 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 20:37:25,001 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 20:37:25,003 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 20:37:25,006 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 20:37:25,008 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 20:37:25,010 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 20:37:25,012 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 20:37:25,013 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 20:37:25,015 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 20:37:25,017 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 20:37:25,023 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 20:37:25,025 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 20:37:25,027 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 20:37:25,028 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 20:37:25,030 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 20:37:25,031 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 20:37:25,033 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 20:37:25,034 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 20:37:25,036 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 20:37:25,038 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 20:37:25,040 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 20:37:25,042 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 20:37:25,043 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 20:37:25,045 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 20:37:25,047 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 20:37:25,322 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-28 20:37:35,118 WARN L192 SmtUtils]: Spent 9.75 s on a formula simplification. DAG size of input: 174 DAG size of output: 174 [2019-11-28 20:37:35,314 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:37:35,314 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,324 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 20:37:35,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,329 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,336 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 20:37:35,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,341 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,347 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 20:37:35,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,352 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,356 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 20:37:35,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,360 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,366 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 20:37:35,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:35,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:35,372 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:37:35,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:35,382 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,393 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 20:37:35,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:35,397 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,404 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 20:37:35,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:35,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:35,413 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,418 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 20:37:35,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,420 INFO L203 nArgumentSynthesizer]: 128 stem disjuncts [2019-11-28 20:37:35,420 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:37:35,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,717 INFO L401 nArgumentSynthesizer]: We have 524 Motzkin's Theorem applications. [2019-11-28 20:37:35,718 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 20:37:36,387 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,398 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 20:37:36,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:36,413 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,426 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:36,438 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,449 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 20:37:36,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,460 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,467 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 20:37:36,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,484 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,492 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 20:37:36,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:36,510 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:37:36,533 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 20:37:36,533 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,538 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,541 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:37:36,541 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:37:36,541 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2019-11-28 20:37:36,559 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 20:37:36,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:37:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:36,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:37:36,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:36,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:36,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:37:36,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:36,735 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-28 20:37:36,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:36,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:36,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:37:36,743 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-28 20:37:36,756 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 20:37:36,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 20:37:36,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 20:37:36,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2019-11-28 20:37:36,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:37:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-28 20:37:36,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-28 20:37:36,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:36,838 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:37:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:36,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:37:36,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:36,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:36,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:37:36,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:37,007 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-28 20:37:37,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:37,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:37,013 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:37:37,013 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-28 20:37:37,027 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 20:37:37,028 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 20:37:37,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 20:37:37,093 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2019-11-28 20:37:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:37:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-28 20:37:37,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-28 20:37:37,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:37,097 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:37:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:37,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:37:37,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:37,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:37,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:37,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:37,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:37:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:37,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:37:37,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:37,271 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-28 20:37:37,271 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:37:37,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:37:37,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:37:37,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-28 20:37:37,296 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 20:37:37,296 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 20:37:37,296 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 20:37:37,406 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2019-11-28 20:37:37,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:37:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-11-28 20:37:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-28 20:37:37,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:37,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 40 letters. Loop has 3 letters. [2019-11-28 20:37:37,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:37,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 6 letters. [2019-11-28 20:37:37,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:37,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2019-11-28 20:37:37,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:37:37,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2019-11-28 20:37:37,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:37:37,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:37:37,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:37:37,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:37,415 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:37:37,415 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:37:37,415 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:37:37,415 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:37:37,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:37:37,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:37:37,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:37:37,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:37:37 BoogieIcfgContainer [2019-11-28 20:37:37,426 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:37:37,428 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:37:37,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:37:37,428 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:37:37,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:01" (3/4) ... [2019-11-28 20:37:37,433 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:37:37,433 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:37:37,437 INFO L168 Benchmark]: Toolchain (without parser) took 36360.45 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 591.4 MB). Free memory was 960.4 MB in the beginning and 876.0 MB in the end (delta: 84.4 MB). Peak memory consumption was 675.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:37,437 INFO L168 Benchmark]: CDTParser took 0.32 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 20:37:37,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.86 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 20:37:37,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:37,441 INFO L168 Benchmark]: Boogie Preprocessor took 37.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:37,442 INFO L168 Benchmark]: RCFGBuilder took 301.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:37,448 INFO L168 Benchmark]: BuchiAutomizer took 35637.94 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 456.7 MB). Free memory was 1.1 GB in the beginning and 876.0 MB in the end (delta: 228.4 MB). Peak memory consumption was 685.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:37,448 INFO L168 Benchmark]: Witness Printer took 5.41 ms. Allocated memory is still 1.6 GB. Free memory is still 876.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:37:37,453 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.32 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 274.86 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 96.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 301.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 35637.94 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 456.7 MB). Free memory was 1.1 GB in the beginning and 876.0 MB in the end (delta: 228.4 MB). Peak memory consumption was 685.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.41 ms. Allocated memory is still 1.6 GB. Free memory is still 876.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[ip][ip] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 35.5s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 32.6s. Construction of modules took 0.7s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/30 HoareTripleCheckerStatistics: 82 SDtfs, 61 SDslu, 243 SDs, 0 SdLazy, 618 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital364 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp31 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf2648 smp80 tf100 neg86 sie150 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2284ms VariablesStem: 3 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 608 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...