./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_true-termination.c.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 d6678868f165c4dda1e615b0f5d66797a7e8aaae ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:06:21,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:06:21,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:06:21,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:06:21,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:06:21,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:06:21,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:06:21,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:06:21,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:06:21,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:06:21,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:06:21,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:06:21,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:06:21,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:06:21,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:06:21,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:06:21,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:06:21,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:06:21,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:06:21,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:06:21,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:06:21,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:06:21,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:06:21,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:06:21,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:06:21,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:06:21,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:06:21,836 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:06:21,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:06:21,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:06:21,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:06:21,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:06:21,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:06:21,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:06:21,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:06:21,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:06:21,846 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:06:21,872 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:06:21,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:06:21,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:06:21,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:06:21,873 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:06:21,874 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:06:21,874 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:06:21,874 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:06:21,874 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:06:21,874 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:06:21,874 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:06:21,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:06:21,875 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:06:21,875 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:06:21,875 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:06:21,875 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:06:21,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:06:21,876 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:06:21,876 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:06:21,876 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:06:21,876 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:06:21,876 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:06:21,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:06:21,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:06:21,877 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:06:21,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:06:21,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:06:21,877 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:06:21,878 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:06:21,879 INFO L133 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 -> d6678868f165c4dda1e615b0f5d66797a7e8aaae [2019-01-01 22:06:21,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:06:21,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:06:21,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:06:21,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:06:21,962 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:06:21,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_true-termination.c.i [2019-01-01 22:06:22,017 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/026386d64/ae27911557e44002a0f2ddaddd5a0fd9/FLAGfde718db0 [2019-01-01 22:06:22,468 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:06:22,468 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_true-termination.c.i [2019-01-01 22:06:22,477 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/026386d64/ae27911557e44002a0f2ddaddd5a0fd9/FLAGfde718db0 [2019-01-01 22:06:22,819 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/026386d64/ae27911557e44002a0f2ddaddd5a0fd9 [2019-01-01 22:06:22,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:06:22,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:06:22,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:22,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:06:22,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:06:22,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:22" (1/1) ... [2019-01-01 22:06:22,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420161b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:22, skipping insertion in model container [2019-01-01 22:06:22,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:22" (1/1) ... [2019-01-01 22:06:22,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:06:22,861 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:06:23,054 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:23,065 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:06:23,080 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:23,095 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:06:23,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23 WrapperNode [2019-01-01 22:06:23,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:23,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:23,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:06:23,097 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:06:23,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:23,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:06:23,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:06:23,132 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:06:23,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... [2019-01-01 22:06:23,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:06:23,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:06:23,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:06:23,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:06:23,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:06:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:06:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 22:06:23,288 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 22:06:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 22:06:23,288 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 22:06:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:06:23,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:06:23,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:06:23,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:06:23,566 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:06:23,567 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 22:06:23,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:23 BoogieIcfgContainer [2019-01-01 22:06:23,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:06:23,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:06:23,568 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:06:23,574 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:06:23,575 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:23,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:06:22" (1/3) ... [2019-01-01 22:06:23,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d9ad021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:23, skipping insertion in model container [2019-01-01 22:06:23,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:23,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:23" (2/3) ... [2019-01-01 22:06:23,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d9ad021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:23, skipping insertion in model container [2019-01-01 22:06:23,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:23,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:23" (3/3) ... [2019-01-01 22:06:23,581 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex7B_true-termination.c.i [2019-01-01 22:06:23,656 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:06:23,657 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:06:23,657 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:06:23,657 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:06:23,657 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:06:23,657 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:06:23,657 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:06:23,658 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:06:23,658 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:06:23,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:06:23,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:06:23,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:23,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:23,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:06:23,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:06:23,713 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:06:23,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:06:23,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:06:23,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:23,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:23,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:06:23,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:06:23,723 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet8; 11#L43true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 13#fENTRYtrue [2019-01-01 22:06:23,724 INFO L796 eck$LassoCheckResult]: Loop: 13#fENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);call #t~mem2 := read~int(~q.base, ~q.offset, 4); 15#L13true assume !(#t~mem1 + #t~mem2 < 0);havoc #t~mem2;havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~np~0.base, ~np~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);call write~int(#t~mem4 - 1, ~np~0.base, ~np~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~p.base, ~p.offset); 17#L23true call g(~q.base, ~q.offset, ~np~0.base, ~np~0.offset);< 12#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset; 5#L31true call f(~q.base, ~q.offset, ~p.base, ~p.offset);< 13#fENTRYtrue [2019-01-01 22:06:23,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash 39794, now seen corresponding path program 1 times [2019-01-01 22:06:23,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:23,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash 28764888, now seen corresponding path program 1 times [2019-01-01 22:06:23,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:23,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1102237191, now seen corresponding path program 1 times [2019-01-01 22:06:23,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:23,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:23,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:24,241 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 22:06:24,369 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 22:06:24,622 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 22:06:25,362 WARN L181 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-01-01 22:06:25,536 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 22:06:25,825 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-01 22:06:25,944 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:06:26,175 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-01 22:06:26,306 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 22:06:26,455 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 22:06:26,544 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:26,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:26,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:26,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:26,546 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:26,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:26,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:26,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:26,547 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex7B_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:06:26,547 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:26,547 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:26,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:26,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:27,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-01-01 22:06:27,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-01-01 22:06:27,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-01-01 22:06:27,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-01-01 22:06:27,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-01-01 22:06:27,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-01-01 22:06:27,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-01-01 22:06:27,289 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-01-01 22:06:27,422 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:06:27,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:27,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:27,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:27,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:28,030 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-01 22:06:28,124 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:28,132 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:28,134 INFO L122 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-01-01 22:06:28,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,142 INFO L122 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-01-01 22:06:28,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,145 INFO L122 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-01-01 22:06:28,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,148 INFO L122 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-01-01 22:06:28,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,151 INFO L122 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-01-01 22:06:28,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,154 INFO L122 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-01-01 22:06:28,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,157 INFO L122 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-01-01 22:06:28,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,160 INFO L122 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-01-01 22:06:28,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,163 INFO L122 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-01-01 22:06:28,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,166 INFO L122 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-01-01 22:06:28,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,170 INFO L122 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-01-01 22:06:28,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,172 INFO L122 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-01-01 22:06:28,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,175 INFO L122 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-01-01 22:06:28,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:28,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:28,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,183 INFO L122 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-01-01 22:06:28,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,188 INFO L122 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-01-01 22:06:28,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,195 INFO L122 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-01-01 22:06:28,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,204 INFO L122 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-01-01 22:06:28,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,207 INFO L122 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-01-01 22:06:28,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,213 INFO L122 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-01-01 22:06:28,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,221 INFO L122 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-01-01 22:06:28,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,226 INFO L122 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-01-01 22:06:28,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,235 INFO L122 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-01-01 22:06:28,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,244 INFO L122 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-01-01 22:06:28,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,247 INFO L122 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-01-01 22:06:28,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,255 INFO L122 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-01-01 22:06:28,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:28,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:28,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,265 INFO L122 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-01-01 22:06:28,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,270 INFO L122 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-01-01 22:06:28,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,273 INFO L122 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-01-01 22:06:28,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,276 INFO L122 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-01-01 22:06:28,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,279 INFO L122 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-01-01 22:06:28,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,281 INFO L122 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-01-01 22:06:28,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:28,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:28,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:28,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:28,284 INFO L122 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-01-01 22:06:28,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:28,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:28,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:28,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:28,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:28,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:28,328 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:28,350 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:06:28,351 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:06:28,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:28,358 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:28,358 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:28,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1, v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 2*v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1 + 2*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 + 1 Supporting invariants [] [2019-01-01 22:06:28,432 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:06:28,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:28,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:28,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:28,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:28,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:28,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:28,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 22:06:28,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:28,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 61 [2019-01-01 22:06:28,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 53 [2019-01-01 22:06:28,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:28,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:28,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 43 treesize of output 53 [2019-01-01 22:06:28,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:28,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:28,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 22:06:28,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:87 [2019-01-01 22:06:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:29,184 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 22:06:29,185 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 6 states. [2019-01-01 22:06:29,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 6 states. Result 32 states and 36 transitions. Complement of second has 20 states. [2019-01-01 22:06:29,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 22:06:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 22:06:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 22:06:29,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2019-01-01 22:06:29,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:29,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 22:06:29,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:29,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-01 22:06:29,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:29,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2019-01-01 22:06:29,523 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:29,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-01 22:06:29,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:06:29,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:06:29,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:06:29,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:29,528 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:29,528 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:29,528 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:29,528 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:06:29,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:06:29,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:29,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:06:29,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:06:29 BoogieIcfgContainer [2019-01-01 22:06:29,534 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:06:29,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:06:29,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:06:29,535 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:06:29,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:23" (3/4) ... [2019-01-01 22:06:29,538 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:06:29,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:06:29,539 INFO L168 Benchmark]: Toolchain (without parser) took 6717.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -112.7 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:29,541 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:29,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.22 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:29,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.88 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:29,543 INFO L168 Benchmark]: Boogie Preprocessor took 30.85 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:29,543 INFO L168 Benchmark]: RCFGBuilder took 404.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:29,544 INFO L168 Benchmark]: BuchiAutomizer took 5965.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:29,545 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:29,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.22 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 34.88 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.85 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 404.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5965.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 2 * unknown-#memory_int-unknown[q][q] + 1 and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 5 SDslu, 5 SDs, 0 SdLazy, 41 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital209 mio100 ax100 hnf100 lsp97 ukn71 mio100 lsp25 div100 bol100 ite100 ukn100 eq186 hnf88 smp100 dnf147 smp93 tf100 neg88 sie148 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...