./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.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 b76149a90863628db6af524c153a3f434b0c2e82 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:30:21,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:30:21,120 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:30:21,132 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:30:21,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:30:21,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:30:21,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:30:21,140 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:30:21,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:30:21,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:30:21,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:30:21,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:30:21,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:30:21,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:30:21,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:30:21,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:30:21,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:30:21,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:30:21,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:30:21,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:30:21,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:30:21,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:30:21,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:30:21,170 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:30:21,170 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:30:21,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:30:21,172 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:30:21,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:30:21,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:30:21,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:30:21,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:30:21,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:30:21,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:30:21,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:30:21,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:30:21,178 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:30:21,178 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:30:21,209 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:30:21,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:30:21,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:30:21,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:30:21,211 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:30:21,211 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:30:21,211 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:30:21,211 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:30:21,212 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:30:21,212 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:30:21,212 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:30:21,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:30:21,212 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:30:21,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:30:21,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:30:21,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:30:21,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:30:21,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:30:21,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:30:21,218 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:30:21,218 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:30:21,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:30:21,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:30:21,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:30:21,218 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:30:21,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:30:21,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:30:21,219 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:30:21,221 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:30:21,222 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 -> b76149a90863628db6af524c153a3f434b0c2e82 [2019-01-14 02:30:21,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:30:21,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:30:21,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:30:21,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:30:21,315 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:30:21,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:21,379 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c64a8aa/8ee4d5757494449d980c0d355664208b/FLAGcef6c4813 [2019-01-14 02:30:21,861 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:30:21,862 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:21,880 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c64a8aa/8ee4d5757494449d980c0d355664208b/FLAGcef6c4813 [2019-01-14 02:30:22,174 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c64a8aa/8ee4d5757494449d980c0d355664208b [2019-01-14 02:30:22,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:30:22,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:30:22,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:22,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:30:22,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:30:22,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c781d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22, skipping insertion in model container [2019-01-14 02:30:22,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:30:22,240 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:30:22,589 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:22,604 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:30:22,721 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:22,790 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:30:22,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22 WrapperNode [2019-01-14 02:30:22,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:22,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:22,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:30:22,792 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:30:22,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:22,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:30:22,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:30:22,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:30:22,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (1/1) ... [2019-01-14 02:30:22,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:30:22,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:30:22,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:30:22,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:30:22,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (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-14 02:30:22,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:30:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:30:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:30:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:30:22,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:30:22,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:30:23,337 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:30:23,338 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:30:23,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:23 BoogieIcfgContainer [2019-01-14 02:30:23,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:30:23,341 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:30:23,341 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:30:23,345 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:30:23,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:23,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:30:22" (1/3) ... [2019-01-14 02:30:23,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46d83b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:23, skipping insertion in model container [2019-01-14 02:30:23,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:23,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:22" (2/3) ... [2019-01-14 02:30:23,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46d83b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:23, skipping insertion in model container [2019-01-14 02:30:23,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:23,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:23" (3/3) ... [2019-01-14 02:30:23,353 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.03_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:23,408 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:30:23,409 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:30:23,409 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:30:23,409 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:30:23,409 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:30:23,410 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:30:23,410 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:30:23,410 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:30:23,410 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:30:23,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:30:23,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:23,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:23,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:23,448 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:30:23,448 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:23,449 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:30:23,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:30:23,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:23,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:23,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:23,451 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:30:23,451 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:23,459 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L553true assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 9#L556-5true [2019-01-14 02:30:23,460 INFO L796 eck$LassoCheckResult]: Loop: 9#L556-5true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 12#L556-1true assume !test_fun_#t~short10; 5#L556-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 7#L557true assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 9#L556-5true [2019-01-14 02:30:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:30:23,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:23,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:23,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2019-01-14 02:30:23,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:23,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:23,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:23,751 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-14 02:30:23,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:30:23,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:30:23,761 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:30:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:30:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:30:23,788 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2019-01-14 02:30:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:30:23,908 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-14 02:30:23,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:30:23,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-14 02:30:23,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:23,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2019-01-14 02:30:23,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:30:23,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:30:23,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2019-01-14 02:30:23,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:23,931 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-14 02:30:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2019-01-14 02:30:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:30:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:30:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-14 02:30:23,966 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-14 02:30:23,967 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-14 02:30:23,967 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:30:23,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2019-01-14 02:30:23,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:23,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:23,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:23,970 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:30:23,970 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:23,970 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 35#L553 assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 36#L556-5 [2019-01-14 02:30:23,971 INFO L796 eck$LassoCheckResult]: Loop: 36#L556-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 40#L556-1 assume test_fun_#t~short10;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem9 <= 2147483647 - test_fun_#t~mem8; 37#L556-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 38#L557 assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 36#L556-5 [2019-01-14 02:30:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-14 02:30:23,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:23,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:23,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:23,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:23,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2019-01-14 02:30:24,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:24,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:24,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2019-01-14 02:30:24,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:24,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:24,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:24,606 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-01-14 02:30:24,858 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 02:30:25,426 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-14 02:30:25,637 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:30:25,650 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:25,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:25,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:25,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:25,652 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:25,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:25,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:25,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:25,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2019-01-14 02:30:25,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:25,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:25,677 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-14 02:30:25,692 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-14 02:30:25,699 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-14 02:30:25,702 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-14 02:30:25,706 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-14 02:30:25,713 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-14 02:30:25,716 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-14 02:30:25,719 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-14 02:30:25,726 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-14 02:30:25,730 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-14 02:30:25,732 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-14 02:30:25,738 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-14 02:30:25,740 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-14 02:30:25,747 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-14 02:30:25,767 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-14 02:30:25,769 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-14 02:30:25,791 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-14 02:30:25,803 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-14 02:30:26,156 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-14 02:30:26,296 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-14 02:30:26,297 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-14 02:30:26,300 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-14 02:30:26,304 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-14 02:30:26,841 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:30:26,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:27,004 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:27,006 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-14 02:30:27,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,017 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-14 02:30:27,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,023 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-14 02:30:27,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,029 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-14 02:30:27,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,034 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-14 02:30:27,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,040 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-14 02:30:27,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,046 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-14 02:30:27,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,051 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-14 02:30:27,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:27,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,061 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-14 02:30:27,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,067 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-14 02:30:27,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,073 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-14 02:30:27,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:27,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,084 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-14 02:30:27,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:27,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,092 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-14 02:30:27,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,098 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-14 02:30:27,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,104 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-14 02:30:27,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,109 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-14 02:30:27,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,116 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-14 02:30:27,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:27,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:27,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:27,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,123 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-14 02:30:27,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,124 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:30:27,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,138 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:30:27,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,197 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-14 02:30:27,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:27,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,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-14 02:30:27,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:27,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,239 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-14 02:30:27,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:27,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:27,248 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-14 02:30:27,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:27,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:27,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:27,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:27,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:27,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:27,305 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:27,337 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:30:27,338 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:30:27,341 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:27,342 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:30:27,343 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:27,344 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2019-01-14 02:30:27,397 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:30:27,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:27,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:27,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:27,694 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-01-14 02:30:27,726 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-14 02:30:27,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:30:27,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-01-14 02:30:27,867 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 11 states and 12 transitions. Complement of second has 8 states. [2019-01-14 02:30:27,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:30:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-14 02:30:27,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:30:27,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:27,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:30:27,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:27,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2019-01-14 02:30:27,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:27,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-01-14 02:30:27,874 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:27,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-01-14 02:30:27,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:30:27,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:30:27,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:30:27,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:27,875 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:27,875 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:27,875 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:27,875 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:30:27,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:30:27,875 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:27,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:30:27,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:30:27 BoogieIcfgContainer [2019-01-14 02:30:27,883 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:30:27,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:30:27,883 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:30:27,884 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:30:27,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:23" (3/4) ... [2019-01-14 02:30:27,888 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:30:27,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:30:27,889 INFO L168 Benchmark]: Toolchain (without parser) took 5711.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -228.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:27,890 INFO L168 Benchmark]: CDTParser took 0.16 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-14 02:30:27,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:27,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:27,893 INFO L168 Benchmark]: Boogie Preprocessor took 28.98 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-14 02:30:27,893 INFO L168 Benchmark]: RCFGBuilder took 460.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:27,894 INFO L168 Benchmark]: BuchiAutomizer took 4541.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:27,895 INFO L168 Benchmark]: Witness Printer took 5.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:27,901 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.16 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 612.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.98 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. * RCFGBuilder took 460.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4541.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 4294967293 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 3 SDslu, 9 SDs, 0 SdLazy, 15 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax108 hnf100 lsp89 ukn69 mio100 lsp31 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf162 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 71ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...