./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.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-memory-alloca/b.11-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 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:47:46,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:47:46,906 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:47:46,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:47:46,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:47:46,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:47:46,928 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:47:46,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:47:46,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:47:46,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:47:46,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:47:46,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:47:46,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:47:46,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:47:46,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:47:46,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:47:46,946 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:47:46,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:47:46,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:47:46,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:47:46,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:47:46,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:47:46,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:47:46,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:47:46,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:47:46,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:47:46,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:47:46,979 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:47:46,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:47:46,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:47:46,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:47:46,983 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:47:46,983 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:47:46,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:47:46,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:47:46,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:47:46,988 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:47:47,018 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:47:47,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:47:47,019 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:47:47,019 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:47:47,020 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:47:47,021 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:47:47,021 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:47:47,021 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:47:47,021 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:47:47,021 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:47:47,022 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:47:47,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:47:47,022 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:47:47,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:47:47,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:47:47,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:47:47,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:47:47,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:47:47,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:47:47,024 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:47:47,024 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:47:47,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:47:47,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:47:47,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:47:47,025 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:47:47,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:47:47,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:47:47,025 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:47:47,026 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:47:47,027 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 -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2019-01-01 21:47:47,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:47:47,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:47:47,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:47:47,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:47:47,121 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:47:47,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:47,179 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643de5de6/46b19a93fc73452ead91a6d7a906ea8d/FLAG19e7590e0 [2019-01-01 21:47:47,667 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:47:47,668 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:47,684 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643de5de6/46b19a93fc73452ead91a6d7a906ea8d/FLAG19e7590e0 [2019-01-01 21:47:47,987 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643de5de6/46b19a93fc73452ead91a6d7a906ea8d [2019-01-01 21:47:47,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:47:47,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:47:47,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:47,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:47:47,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:47:47,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:47" (1/1) ... [2019-01-01 21:47:48,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67926572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:47, skipping insertion in model container [2019-01-01 21:47:48,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:47" (1/1) ... [2019-01-01 21:47:48,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:47:48,051 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:47:48,436 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:48,451 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:47:48,576 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:48,625 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:48,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48 WrapperNode [2019-01-01 21:47:48,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:48,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:48,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:48,628 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:48,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:48,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:48,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:48,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:48,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... [2019-01-01 21:47:48,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:48,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:48,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:48,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:48,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:49,272 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:49,273 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:47:49,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:49 BoogieIcfgContainer [2019-01-01 21:47:49,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:49,274 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:49,274 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:49,279 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:49,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:49,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:47:47" (1/3) ... [2019-01-01 21:47:49,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c9d5776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:49, skipping insertion in model container [2019-01-01 21:47:49,282 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:49,282 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:48" (2/3) ... [2019-01-01 21:47:49,282 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c9d5776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:49, skipping insertion in model container [2019-01-01 21:47:49,282 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:49,283 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:49" (3/3) ... [2019-01-01 21:47:49,284 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.11-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:49,343 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:49,344 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:49,344 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:49,344 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:49,344 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:49,344 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:49,345 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:49,345 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:49,345 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:49,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:47:49,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:47:49,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:49,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:49,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:47:49,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:49,395 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:49,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:47:49,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:47:49,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:49,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:49,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:47:49,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:49,408 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2019-01-01 21:47:49,409 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 5#L559-2true [2019-01-01 21:47:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:47:49,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:49,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:49,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2019-01-01 21:47:49,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:49,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:49,715 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 21:47:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:47:49,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:47:49,722 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:47:49,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:47:49,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:47:49,739 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-01-01 21:47:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:47:50,011 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-01-01 21:47:50,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:47:50,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-01 21:47:50,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 21:47:50,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2019-01-01 21:47:50,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:47:50,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:47:50,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-01 21:47:50,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:50,035 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 21:47:50,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-01 21:47:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 21:47:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:47:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-01-01 21:47:50,075 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-01 21:47:50,076 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-01 21:47:50,076 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:47:50,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-01-01 21:47:50,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-01 21:47:50,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:50,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:50,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:47:50,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:50,079 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2019-01-01 21:47:50,079 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 53#L559-2 [2019-01-01 21:47:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:47:50,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:50,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:50,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:50,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2019-01-01 21:47:50,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:50,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:50,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:50,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:50,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2019-01-01 21:47:50,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:50,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:50,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:50,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:50,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:51,248 WARN L181 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-01-01 21:47:52,001 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-01 21:47:52,233 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-01 21:47:52,247 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:52,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:52,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:52,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:52,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:52,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:52,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:52,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:52,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2019-01-01 21:47:52,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:52,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:52,279 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 21:47:52,306 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 21:47:52,311 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 21:47:52,322 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 21:47:52,328 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 21:47:52,353 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 21:47:52,368 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 21:47:52,377 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 21:47:52,380 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 21:47:52,383 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 21:47:52,393 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 21:47:52,397 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 21:47:52,400 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 21:47:52,403 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 21:47:52,408 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 21:47:52,411 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 21:47:52,414 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 21:47:52,418 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 21:47:52,438 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 21:47:52,451 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 21:47:52,453 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 21:47:52,458 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 21:47:52,462 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 21:47:52,467 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 21:47:52,471 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 21:47:52,474 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 21:47:52,480 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 21:47:52,482 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 21:47:52,939 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-01-01 21:47:53,100 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-01-01 21:47:53,101 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 21:47:53,104 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 21:47:54,533 WARN L181 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:47:54,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:54,598 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:54,600 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 21:47:54,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,609 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 21:47:54,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,612 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 21:47:54,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,615 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 21:47:54,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,618 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 21:47:54,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,621 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 21:47:54,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,624 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 21:47:54,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:54,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:54,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,631 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 21:47:54,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:54,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:54,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,637 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 21:47:54,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,640 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 21:47:54,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,643 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 21:47:54,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,646 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 21:47:54,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,649 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 21:47:54,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,652 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 21:47:54,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:54,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:54,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,658 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 21:47:54,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,661 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 21:47:54,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,664 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 21:47:54,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,667 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 21:47:54,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,670 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 21:47:54,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,673 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 21:47:54,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,676 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 21:47:54,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,679 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 21:47:54,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:54,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:54,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,684 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 21:47:54,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,687 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 21:47:54,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:54,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:54,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,695 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 21:47:54,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,701 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 21:47:54,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,704 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 21:47:54,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:54,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:54,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:54,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,714 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 21:47:54,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:54,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:54,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:54,745 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 21:47:54,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:54,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:54,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:54,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:54,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:54,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:54,780 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:54,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:54,803 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:54,808 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:54,810 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:54,811 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:54,811 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-01 21:47:55,047 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-01-01 21:47:55,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:55,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:55,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:55,309 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 21:47:55,313 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:47:55,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-01 21:47:55,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 31 states and 45 transitions. Complement of second has 8 states. [2019-01-01 21:47:55,588 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-01 21:47:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:47:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 21:47:55,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:47:55,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:55,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 21:47:55,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:55,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-01 21:47:55,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:55,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2019-01-01 21:47:55,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-01 21:47:55,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2019-01-01 21:47:55,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:47:55,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:47:55,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2019-01-01 21:47:55,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:55,598 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-01-01 21:47:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2019-01-01 21:47:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-01 21:47:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 21:47:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-01-01 21:47:55,601 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-01-01 21:47:55,601 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-01-01 21:47:55,601 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:47:55,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2019-01-01 21:47:55,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-01 21:47:55,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:55,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:55,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:55,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:55,604 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 257#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2019-01-01 21:47:55,604 INFO L796 eck$LassoCheckResult]: Loop: 240#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 254#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 259#L555-4 assume test_fun_#t~short13; 243#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 244#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 251#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 246#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 247#L559 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; 239#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2019-01-01 21:47:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:47:55,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:55,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:55,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:55,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2019-01-01 21:47:55,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:55,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:55,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:55,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -198955769, now seen corresponding path program 1 times [2019-01-01 21:47:55,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:55,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:55,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:55,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:56,575 WARN L181 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-01-01 21:47:56,794 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-01-01 21:47:57,222 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-01-01 21:47:57,844 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-01 21:47:57,849 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:57,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:57,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:57,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:57,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:57,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:57,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:57,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:57,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2019-01-01 21:47:57,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:57,850 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:57,873 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 21:47:57,877 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 21:47:57,885 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 21:47:57,887 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 21:47:57,888 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 21:47:57,894 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 21:47:57,896 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 21:47:57,899 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 21:47:57,905 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 21:47:58,884 WARN L181 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-01 21:47:59,180 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-01-01 21:47:59,180 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 21:47:59,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:59,194 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 21:47:59,196 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 21:47:59,201 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 21:47:59,204 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 21:47:59,206 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 21:47:59,209 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 21:47:59,212 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 21:47:59,215 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 21:47:59,218 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 21:47:59,221 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 21:47:59,223 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 21:47:59,225 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 21:47:59,230 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 21:47:59,248 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 21:47:59,250 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 21:47:59,255 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 21:48:00,310 WARN L181 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:48:00,579 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-01 21:48:00,722 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-01 21:48:00,756 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:00,756 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:00,756 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 21:48:00,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,760 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 21:48:00,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,763 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 21:48:00,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,765 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 21:48:00,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,767 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 21:48:00,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,769 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 21:48:00,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,771 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 21:48:00,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:00,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:00,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:00,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,774 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 21:48:00,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,778 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 21:48:00,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,783 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 21:48:00,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,791 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 21:48:00,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,824 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 21:48:00,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,825 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:48:00,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,831 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:48:00,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,857 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 21:48:00,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,861 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 21:48:00,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,867 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 21:48:00,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,881 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 21:48:00,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:00,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:00,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:00,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:00,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:00,887 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 21:48:00,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:00,888 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:48:00,888 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:48:00,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:00,897 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:48:00,897 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:48:00,985 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:01,098 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:48:01,099 INFO L444 ModelExtractionUtils]: 47 out of 56 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 21:48:01,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:01,109 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:48:01,109 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:01,109 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-01-01 21:48:01,725 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-01-01 21:48:01,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:01,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:01,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:02,043 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-01-01 21:48:02,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:02,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2019-01-01 21:48:02,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:02,182 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 0 case distinctions, treesize of input 52 treesize of output 39 [2019-01-01 21:48:02,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:02,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:02,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2019-01-01 21:48:02,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:48:02,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:02,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:48:02,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2019-01-01 21:48:02,344 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 21:48:02,345 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 21:48:02,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 7 states. [2019-01-01 21:48:02,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 64 states and 97 transitions. Complement of second has 10 states. [2019-01-01 21:48:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:48:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2019-01-01 21:48:02,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 9 letters. [2019-01-01 21:48:02,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:02,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 9 letters. [2019-01-01 21:48:02,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:02,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 18 letters. [2019-01-01 21:48:02,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:02,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 97 transitions. [2019-01-01 21:48:02,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-01 21:48:02,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 97 transitions. [2019-01-01 21:48:02,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:48:02,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 21:48:02,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 97 transitions. [2019-01-01 21:48:02,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:02,530 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 97 transitions. [2019-01-01 21:48:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 97 transitions. [2019-01-01 21:48:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-01-01 21:48:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 21:48:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2019-01-01 21:48:02,539 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2019-01-01 21:48:02,539 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2019-01-01 21:48:02,539 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:48:02,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 94 transitions. [2019-01-01 21:48:02,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-01 21:48:02,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:02,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:02,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:02,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:02,542 INFO L794 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 513#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 514#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 552#L555-1 assume !test_fun_#t~short8; 516#L555-3 [2019-01-01 21:48:02,542 INFO L796 eck$LassoCheckResult]: Loop: 516#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 517#L555-4 assume test_fun_#t~short13; 519#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 507#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 508#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 502#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 503#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 495#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 496#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 516#L555-3 [2019-01-01 21:48:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-01 21:48:02,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:02,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:02,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:02,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 1 times [2019-01-01 21:48:02,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:02,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2029276831, now seen corresponding path program 1 times [2019-01-01 21:48:02,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:02,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:02,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:02,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:02,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:48:03,771 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-01-01 21:48:04,032 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:48:04,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:48:04,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:48:04,034 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. cyclomatic complexity: 36 Second operand 4 states. [2019-01-01 21:48:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:04,095 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2019-01-01 21:48:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:48:04,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2019-01-01 21:48:04,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-01-01 21:48:04,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 130 transitions. [2019-01-01 21:48:04,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:48:04,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:48:04,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2019-01-01 21:48:04,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:04,103 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2019-01-01 21:48:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2019-01-01 21:48:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2019-01-01 21:48:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 21:48:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2019-01-01 21:48:04,111 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2019-01-01 21:48:04,111 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2019-01-01 21:48:04,111 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:48:04,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2019-01-01 21:48:04,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-01 21:48:04,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:04,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:04,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:04,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:04,115 INFO L794 eck$LassoCheckResult]: Stem: 680#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 678#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 679#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 709#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 690#L555-3 [2019-01-01 21:48:04,115 INFO L796 eck$LassoCheckResult]: Loop: 690#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 719#L555-4 assume test_fun_#t~short13; 718#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 669#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 670#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 665#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 666#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 658#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 659#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 690#L555-3 [2019-01-01 21:48:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2019-01-01 21:48:04,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 2 times [2019-01-01 21:48:04,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:04,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1872663455, now seen corresponding path program 1 times [2019-01-01 21:48:04,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:04,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:04,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:04,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:04,785 WARN L181 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-01-01 21:48:05,017 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:48:05,528 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2019-01-01 21:48:06,214 WARN L181 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-01 21:48:06,218 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:06,219 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:06,219 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:06,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:06,219 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:06,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:06,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:06,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:06,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2019-01-01 21:48:06,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:06,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:06,232 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 21:48:06,258 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 21:48:06,263 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 21:48:06,264 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 21:48:06,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:06,267 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 21:48:06,269 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 21:48:06,279 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 21:48:06,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-01 21:48:06,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:06,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:06,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:06,322 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 21:48:06,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:06,327 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 21:48:06,330 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 21:48:06,332 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 21:48:06,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:06,337 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 21:48:06,339 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 21:48:06,341 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 21:48:07,436 WARN L181 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-01-01 21:48:07,647 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-01-01 21:48:07,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:07,650 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 21:48:07,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 21:48:07,653 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 21:48:07,655 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 21:48:07,834 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-01 21:48:07,993 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-01-01 21:48:08,536 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-01 21:48:08,739 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-01 21:48:09,144 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:48:09,168 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:09,168 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:09,169 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 21:48:09,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,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 21:48:09,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,174 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 21:48:09,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,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 21:48:09,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,177 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 21:48:09,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,179 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 21:48:09,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,181 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 21:48:09,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,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 21:48:09,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,185 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 21:48:09,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,189 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 21:48:09,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,193 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 21:48:09,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,194 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 21:48:09,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,196 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 21:48:09,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,198 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 21:48:09,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,200 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 21:48:09,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,203 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 21:48:09,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,205 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 21:48:09,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,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 21:48:09,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:09,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:09,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:09,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,209 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 21:48:09,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,212 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 21:48:09,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,215 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 21:48:09,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,218 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 21:48:09,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,223 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 21:48:09,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,240 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 21:48:09,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,246 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 21:48:09,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:09,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:09,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:09,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:09,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:09,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-01 21:48:09,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:09,249 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:48:09,249 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:48:09,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:09,257 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:48:09,258 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:48:09,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:09,772 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:48:09,772 INFO L444 ModelExtractionUtils]: 53 out of 66 variables were initially zero. Simplification set additionally 11 variables to zero. [2019-01-01 21:48:09,773 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:09,776 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:48:09,777 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:09,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-01-01 21:48:10,287 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-01-01 21:48:10,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:10,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:10,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:10,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:10,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2019-01-01 21:48:10,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:10,476 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 0 case distinctions, treesize of input 52 treesize of output 39 [2019-01-01 21:48:10,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:10,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:10,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2019-01-01 21:48:10,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:48:10,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:48:10,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:48:10,609 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2019-01-01 21:48:10,650 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 21:48:10,650 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 21:48:10,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand 7 states. [2019-01-01 21:48:10,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 204 states and 297 transitions. Complement of second has 10 states. [2019-01-01 21:48:10,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:48:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2019-01-01 21:48:10,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 9 letters. [2019-01-01 21:48:10,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:10,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 13 letters. Loop has 9 letters. [2019-01-01 21:48:10,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:10,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 18 letters. [2019-01-01 21:48:10,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:10,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 297 transitions. [2019-01-01 21:48:10,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:48:10,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 54 states and 73 transitions. [2019-01-01 21:48:10,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:48:10,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:48:10,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2019-01-01 21:48:10,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:10,839 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2019-01-01 21:48:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2019-01-01 21:48:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-01 21:48:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 21:48:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2019-01-01 21:48:10,846 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2019-01-01 21:48:10,847 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2019-01-01 21:48:10,847 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:48:10,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2019-01-01 21:48:10,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:48:10,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:10,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:10,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:10,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:10,849 INFO L794 eck$LassoCheckResult]: Stem: 1117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1115#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1116#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1144#L555-1 assume !test_fun_#t~short8; 1118#L555-3 [2019-01-01 21:48:10,849 INFO L796 eck$LassoCheckResult]: Loop: 1118#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1119#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1122#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1092#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1093#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1100#L555-10 assume !test_fun_#t~short16; 1107#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1102#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1103#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1096#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1097#L555-1 assume !test_fun_#t~short8; 1118#L555-3 [2019-01-01 21:48:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-01-01 21:48:10,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:10,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:10,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:10,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1675651104, now seen corresponding path program 1 times [2019-01-01 21:48:10,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:10,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:10,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:10,931 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 21:48:10,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:10,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:48:10,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:48:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:48:10,932 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 23 Second operand 3 states. [2019-01-01 21:48:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:11,003 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2019-01-01 21:48:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:48:11,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2019-01-01 21:48:11,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:48:11,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 69 transitions. [2019-01-01 21:48:11,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:48:11,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:48:11,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2019-01-01 21:48:11,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:11,006 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-01-01 21:48:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2019-01-01 21:48:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-01 21:48:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 21:48:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-01-01 21:48:11,026 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-01-01 21:48:11,026 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-01-01 21:48:11,027 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:48:11,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2019-01-01 21:48:11,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:48:11,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:11,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:11,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:11,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:11,028 INFO L794 eck$LassoCheckResult]: Stem: 1235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1234#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1214#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1215#L555-1 assume !test_fun_#t~short8; 1236#L555-3 [2019-01-01 21:48:11,029 INFO L796 eck$LassoCheckResult]: Loop: 1236#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1237#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1240#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1210#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1211#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1219#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1226#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1221#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1222#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1243#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1246#L555-1 assume !test_fun_#t~short8; 1236#L555-3 [2019-01-01 21:48:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:11,034 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2019-01-01 21:48:11,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:11,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:11,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:11,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1732909406, now seen corresponding path program 1 times [2019-01-01 21:48:11,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:11,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:11,318 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 21:48:11,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:11,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:48:11,319 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:11,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:48:11,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:48:11,320 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. cyclomatic complexity: 19 Second operand 7 states. [2019-01-01 21:48:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:11,527 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2019-01-01 21:48:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:48:11,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2019-01-01 21:48:11,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:48:11,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 86 transitions. [2019-01-01 21:48:11,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:48:11,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:48:11,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 86 transitions. [2019-01-01 21:48:11,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:11,533 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-01-01 21:48:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 86 transitions. [2019-01-01 21:48:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-01 21:48:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 21:48:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-01-01 21:48:11,538 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-01-01 21:48:11,538 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-01-01 21:48:11,538 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:48:11,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 86 transitions. [2019-01-01 21:48:11,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:48:11,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:11,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:11,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:11,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:11,540 INFO L794 eck$LassoCheckResult]: Stem: 1378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1376#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1377#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1413#L555-1 assume !test_fun_#t~short8; 1379#L555-3 [2019-01-01 21:48:11,540 INFO L796 eck$LassoCheckResult]: Loop: 1379#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1380#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1382#L555-6 assume !test_fun_#t~short12; 1358#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1359#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1366#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1372#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short13;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem11;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1368#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1369#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem21;havoc test_fun_#t~mem20;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1362#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1363#L555-1 assume !test_fun_#t~short8; 1379#L555-3 [2019-01-01 21:48:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2019-01-01 21:48:11,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:11,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:11,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:11,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1052851036, now seen corresponding path program 1 times [2019-01-01 21:48:11,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:11,712 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 21:48:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:11,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:48:11,713 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:48:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:48:11,713 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-01-01 21:48:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:11,798 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-01-01 21:48:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:48:11,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2019-01-01 21:48:11,800 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:11,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2019-01-01 21:48:11,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:48:11,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:48:11,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:48:11,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:11,801 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:11,801 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:11,801 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:11,801 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:48:11,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:48:11,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:11,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:48:11,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:48:11 BoogieIcfgContainer [2019-01-01 21:48:11,809 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:48:11,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:48:11,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:48:11,810 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:48:11,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:49" (3/4) ... [2019-01-01 21:48:11,815 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:48:11,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:48:11,816 INFO L168 Benchmark]: Toolchain (without parser) took 23824.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 954.0 MB in the beginning and 773.4 MB in the end (delta: 180.7 MB). Peak memory consumption was 524.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:11,817 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 21:48:11,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:11,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:11,821 INFO L168 Benchmark]: Boogie Preprocessor took 38.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:11,821 INFO L168 Benchmark]: RCFGBuilder took 554.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:11,822 INFO L168 Benchmark]: BuchiAutomizer took 22535.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 773.4 MB in the end (delta: 291.0 MB). Peak memory consumption was 522.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:11,824 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 1.4 GB. Free memory is still 773.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:11,829 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 634.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 554.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22535.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 773.4 MB in the end (delta: 291.0 MB). Peak memory consumption was 522.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 ms. Allocated memory is still 1.4 GB. Free memory is still 773.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.4s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 19.6s. Construction of modules took 0.6s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 80 SDslu, 179 SDs, 0 SdLazy, 214 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital516 mio100 ax104 hnf99 lsp73 ukn75 mio100 lsp28 div100 bol107 ite100 ukn100 eq162 hnf90 smp91 dnf364 smp79 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...