./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 25885afdfdd91cf9312b78ad87a032f4ef31fe0c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:30:36,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:30:36,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:30:36,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:30:36,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:30:36,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:30:36,780 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:30:36,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:30:36,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:30:36,784 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:30:36,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:30:36,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:30:36,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:30:36,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:30:36,790 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:30:36,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:30:36,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:30:36,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:30:36,796 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:30:36,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:30:36,799 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:30:36,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:30:36,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:30:36,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:30:36,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:30:36,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:30:36,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:30:36,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:30:36,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:30:36,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:30:36,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:30:36,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:30:36,812 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:30:36,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:30:36,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:30:36,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:30:36,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:30:36,841 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:30:36,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:30:36,846 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:30:36,846 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:30:36,847 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:30:36,849 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:30:36,849 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:30:36,849 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:30:36,850 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:30:36,850 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:30:36,850 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:30:36,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:30:36,850 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:30:36,851 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:30:36,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:30:36,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:30:36,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:30:36,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:30:36,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:30:36,855 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:30:36,855 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:30:36,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:30:36,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:30:36,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:30:36,856 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:30:36,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:30:36,856 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:30:36,857 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:30:36,858 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:30:36,860 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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2019-01-14 02:30:36,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:30:36,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:30:36,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:30:36,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:30:36,939 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:30:36,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:36,998 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a807590e6/f3e26833547c42acbf9db45e20238603/FLAGc38dc6a53 [2019-01-14 02:30:37,454 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:30:37,454 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:37,469 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a807590e6/f3e26833547c42acbf9db45e20238603/FLAGc38dc6a53 [2019-01-14 02:30:37,788 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a807590e6/f3e26833547c42acbf9db45e20238603 [2019-01-14 02:30:37,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:30:37,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:30:37,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:37,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:30:37,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:30:37,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:37" (1/1) ... [2019-01-14 02:30:37,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a2acbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:37, skipping insertion in model container [2019-01-14 02:30:37,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:37" (1/1) ... [2019-01-14 02:30:37,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:30:37,862 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:30:38,254 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:38,268 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:30:38,340 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:38,471 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:30:38,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38 WrapperNode [2019-01-14 02:30:38,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:38,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:38,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:30:38,472 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:30:38,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:38,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:30:38,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:30:38,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:30:38,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... [2019-01-14 02:30:38,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:30:38,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:30:38,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:30:38,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:30:38,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:30:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:30:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:30:38,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:30:39,063 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:30:39,064 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:30:39,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:39 BoogieIcfgContainer [2019-01-14 02:30:39,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:30:39,066 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:30:39,066 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:30:39,071 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:30:39,072 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:39,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:30:37" (1/3) ... [2019-01-14 02:30:39,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67a24fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:39, skipping insertion in model container [2019-01-14 02:30:39,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:39,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:38" (2/3) ... [2019-01-14 02:30:39,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67a24fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:39, skipping insertion in model container [2019-01-14 02:30:39,076 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:39,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:39" (3/3) ... [2019-01-14 02:30:39,078 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:39,140 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:30:39,140 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:30:39,141 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:30:39,141 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:30:39,141 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:30:39,141 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:30:39,141 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:30:39,141 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:30:39,142 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:30:39,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:30:39,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:39,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:39,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:39,181 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:30:39,182 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:39,182 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:30:39,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:30:39,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:39,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:39,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:39,184 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:30:39,185 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:39,193 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 7#L558-3true [2019-01-14 02:30:39,194 INFO L796 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2019-01-14 02:30:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2019-01-14 02:30:39,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:39,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:39,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:39,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:39,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:39,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:39,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2019-01-14 02:30:39,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:39,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:39,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:39,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:39,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:39,414 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2019-01-14 02:30:39,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:39,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:39,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:39,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:39,773 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:30:39,929 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:30:41,045 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2019-01-14 02:30:41,227 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-14 02:30:41,242 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:41,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:41,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:41,243 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:41,243 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:41,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:41,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:41,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:41,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2019-01-14 02:30:41,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:41,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:41,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,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-14 02:30:41,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:41,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-14 02:30:41,985 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-14 02:30:42,203 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-14 02:30:42,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-14 02:30:42,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-14 02:30:42,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:42,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:42,426 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 02:30:43,456 WARN L181 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:30:43,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:43,695 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:43,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:43,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:43,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:43,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,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-14 02:30:43,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:43,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,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-14 02:30:43,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:43,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:43,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:43,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:43,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,817 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:30:43,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,829 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:30:43,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:43,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:43,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:43,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:43,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:43,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:43,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:43,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:43,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:30:43,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:43,931 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:30:43,932 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:30:44,070 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:44,127 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:30:44,127 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 02:30:44,130 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:44,132 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:30:44,133 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:44,133 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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-14 02:30:44,388 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:30:44,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:44,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:44,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:44,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2019-01-14 02:30:44,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:30:44,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:44,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2019-01-14 02:30:44,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-01-14 02:30:44,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:44,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:30:44,756 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:44,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-14 02:30:44,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:30:44,814 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:44,822 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:44,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-01-14 02:30:44,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 02:30:44,858 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:44,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:30:44,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-01-14 02:30:44,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2019-01-14 02:30:44,948 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:44,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2019-01-14 02:30:44,975 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:45,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 02:30:45,002 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:45,024 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:45,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:45,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:45,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:30:45,191 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:71, output treesize:10 [2019-01-14 02:30:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:45,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:45,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:45,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2019-01-14 02:30:45,299 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 49 treesize of output 42 [2019-01-14 02:30:45,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:45,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:45,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:45,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-01-14 02:30:45,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:45,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:30:45,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:30:45,604 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:50 [2019-01-14 02:30:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:45,684 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-14 02:30:45,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2019-01-14 02:30:45,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 37 states and 45 transitions. Complement of second has 8 states. [2019-01-14 02:30:45,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:30:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2019-01-14 02:30:45,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:30:45,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:45,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:30:45,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:45,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 02:30:45,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:45,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2019-01-14 02:30:45,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:45,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 18 states and 22 transitions. [2019-01-14 02:30:45,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:30:45,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:30:45,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2019-01-14 02:30:45,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:45,871 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-14 02:30:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2019-01-14 02:30:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-14 02:30:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:30:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-14 02:30:45,897 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:30:45,897 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:30:45,897 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:30:45,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-14 02:30:45,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:45,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:45,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:45,899 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:30:45,899 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:30:45,899 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 208#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 209#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 210#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2019-01-14 02:30:45,902 INFO L796 eck$LassoCheckResult]: Loop: 216#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 217#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 220#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 212#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 213#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2019-01-14 02:30:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash 28695881, now seen corresponding path program 1 times [2019-01-14 02:30:45,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:45,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:45,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 50737098, now seen corresponding path program 1 times [2019-01-14 02:30:45,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:45,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:45,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1682923394, now seen corresponding path program 1 times [2019-01-14 02:30:46,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:46,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:46,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:46,194 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:30:46,628 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 103 [2019-01-14 02:30:46,819 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-14 02:30:46,824 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:46,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:46,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:46,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:46,824 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:46,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:46,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:46,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:46,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2019-01-14 02:30:46,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:46,826 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:46,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:46,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,255 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-01-14 02:30:47,400 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-14 02:30:47,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,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-14 02:30:47,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,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-14 02:30:47,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:47,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:48,349 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:30:48,521 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 02:30:48,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:48,711 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:48,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:48,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:48,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:48,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:48,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:48,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:48,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:48,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:48,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:48,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:48,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:48,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:48,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:48,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:48,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:48,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:48,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:48,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:48,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:48,727 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:30:48,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:48,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:48,734 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:30:48,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:48,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:48,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:48,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:48,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:48,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:48,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:48,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:48,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:48,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:48,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:48,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:48,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:48,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:48,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:48,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:48,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:48,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:48,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:48,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:48,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:48,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:48,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:48,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:48,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:48,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:48,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:48,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:48,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:48,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:30:48,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:48,789 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:30:48,790 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:30:48,848 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:48,925 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 02:30:48,925 INFO L444 ModelExtractionUtils]: 41 out of 51 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-01-14 02:30:48,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:48,927 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:30:48,929 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:48,929 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2019-01-14 02:30:49,244 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:30:49,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:49,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:49,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:49,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2019-01-14 02:30:49,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2019-01-14 02:30:49,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2019-01-14 02:30:49,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:30:49,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2019-01-14 02:30:49,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:30:49,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:49,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-01-14 02:30:49,514 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-01-14 02:30:49,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 02:30:49,570 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 02:30:49,579 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,586 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2019-01-14 02:30:49,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-14 02:30:49,681 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 02:30:49,706 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:49,727 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:49,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-14 02:30:49,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:30:49,776 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,782 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:49,849 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:49,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:49,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:30:49,916 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:91, output treesize:10 [2019-01-14 02:30:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:49,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:50,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2019-01-14 02:30:50,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:50,070 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 33 treesize of output 22 [2019-01-14 02:30:50,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:50,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:50,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:50,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-14 02:30:50,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:50,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2019-01-14 02:30:50,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:50,120 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 23 treesize of output 16 [2019-01-14 02:30:50,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:50,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:50,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:50,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2019-01-14 02:30:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:50,150 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-14 02:30:50,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-01-14 02:30:50,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2019-01-14 02:30:50,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:30:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 02:30:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 02:30:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 02:30:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:30:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:50,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-01-14 02:30:50,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:50,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2019-01-14 02:30:50,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:30:50,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:30:50,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2019-01-14 02:30:50,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:50,228 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-01-14 02:30:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2019-01-14 02:30:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 02:30:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:30:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-01-14 02:30:50,231 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-01-14 02:30:50,231 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-01-14 02:30:50,231 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:30:50,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2019-01-14 02:30:50,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:50,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:50,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:50,233 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:30:50,233 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:30:50,233 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 420#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 421#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 422#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 434#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 438#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 437#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2019-01-14 02:30:50,234 INFO L796 eck$LassoCheckResult]: Loop: 425#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 428#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 429#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 432#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 424#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2019-01-14 02:30:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 2 times [2019-01-14 02:30:50,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:50,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:50,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 2 times [2019-01-14 02:30:50,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:50,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:50,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash -915687550, now seen corresponding path program 1 times [2019-01-14 02:30:50,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:50,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:50,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:50,492 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-14 02:30:51,351 WARN L181 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2019-01-14 02:30:51,601 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-14 02:30:51,604 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:51,604 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:51,604 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:51,604 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:51,604 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:51,604 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:51,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:51,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:51,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2019-01-14 02:30:51,605 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:51,605 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:51,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:51,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-14 02:30:51,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-14 02:30:52,078 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-01-14 02:30:52,210 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:30:52,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:52,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:52,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-14 02:30:52,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:52,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:52,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:53,187 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:30:53,437 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:53,437 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:53,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:53,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:53,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:53,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,539 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:30:53,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,543 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:30:53,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:53,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:53,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:53,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:53,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:53,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:53,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:53,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:53,614 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:53,626 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:30:53,627 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:30:53,628 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:53,628 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:30:53,628 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:53,629 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-14 02:30:54,250 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:30:54,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:54,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:54,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-01-14 02:30:54,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:30:54,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:54,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2019-01-14 02:30:54,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-01-14 02:30:54,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:54,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:30:54,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:54,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2019-01-14 02:30:54,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2019-01-14 02:30:54,708 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2019-01-14 02:30:54,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2019-01-14 02:30:54,861 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:54,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-14 02:30:54,975 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:55,054 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 02:30:55,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2019-01-14 02:30:55,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-14 02:30:55,221 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:55,282 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:30:55,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2019-01-14 02:30:55,285 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:55,341 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:30:55,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2019-01-14 02:30:55,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2019-01-14 02:30:55,513 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:55,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2019-01-14 02:30:55,623 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2019-01-14 02:30:55,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-01-14 02:30:55,740 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:55,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:30:55,858 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:55,937 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:30:56,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-01-14 02:30:56,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:30:56,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:30:56,160 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 3 variables, input treesize:64, output treesize:85 [2019-01-14 02:30:56,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-01-14 02:30:56,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:56,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2019-01-14 02:30:56,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:56,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-14 02:30:56,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:56,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2019-01-14 02:30:56,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 02:30:56,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-14 02:30:56,776 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:56,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:56,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:56,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2019-01-14 02:30:56,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:56,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 02:30:56,941 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:57,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-14 02:30:57,121 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:57,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:57,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2019-01-14 02:30:57,180 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:57,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2019-01-14 02:30:57,227 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:57,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 11 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:30:57,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:30:57,308 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:30, output treesize:30 [2019-01-14 02:30:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:57,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:57,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:57,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2019-01-14 02:30:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:57,482 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 33 treesize of output 22 [2019-01-14 02:30:57,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:57,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:57,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:57,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-14 02:30:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:57,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2019-01-14 02:30:57,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 10 states. [2019-01-14 02:30:57,788 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 60 states and 72 transitions. Complement of second has 11 states. [2019-01-14 02:30:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:30:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2019-01-14 02:30:57,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-14 02:30:57,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:57,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 13 letters. Loop has 5 letters. [2019-01-14 02:30:57,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:57,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-14 02:30:57,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:57,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2019-01-14 02:30:57,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:57,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 41 states and 49 transitions. [2019-01-14 02:30:57,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:30:57,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:30:57,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2019-01-14 02:30:57,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:57,803 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-01-14 02:30:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2019-01-14 02:30:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-01-14 02:30:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:30:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-14 02:30:57,808 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 02:30:57,808 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 02:30:57,808 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:30:57,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-01-14 02:30:57,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:57,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:57,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:57,812 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:30:57,812 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:30:57,812 INFO L794 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 685#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 686#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 687#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 688#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 700#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 709#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 708#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 707#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 705#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 704#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 703#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2019-01-14 02:30:57,812 INFO L796 eck$LassoCheckResult]: Loop: 695#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 690#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 691#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 698#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 694#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2019-01-14 02:30:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1969201019, now seen corresponding path program 3 times [2019-01-14 02:30:57,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:57,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:57,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:57,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:57,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:58,035 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-01-14 02:30:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:58,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:30:58,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:30:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:30:58,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 02:30:58,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:30:58,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:58,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:30:58,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:30:58,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-01-14 02:30:58,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:30:58,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-01-14 02:30:58,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:30:58,477 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-14 02:30:58,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:30:58,506 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,514 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,547 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:85, output treesize:26 [2019-01-14 02:30:58,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2019-01-14 02:30:58,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 02:30:58,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-01-14 02:30:58,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 64 [2019-01-14 02:30:58,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:58,763 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 35 [2019-01-14 02:30:58,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:30:58,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:30:58,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2019-01-14 02:30:58,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2019-01-14 02:30:58,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 02:30:58,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-01-14 02:30:58,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:58,960 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:52, output treesize:7 [2019-01-14 02:30:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:59,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:30:59,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-14 02:30:59,035 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:30:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 3 times [2019-01-14 02:30:59,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:59,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:59,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:59,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:59,243 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-14 02:30:59,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 02:30:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-14 02:30:59,285 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 14 states. [2019-01-14 02:30:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:30:59,630 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-14 02:30:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:30:59,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-01-14 02:30:59,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:59,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 26 transitions. [2019-01-14 02:30:59,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:30:59,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:30:59,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-01-14 02:30:59,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:59,636 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-14 02:30:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-01-14 02:30:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-01-14 02:30:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:30:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-14 02:30:59,641 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 02:30:59,641 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 02:30:59,641 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:30:59,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-01-14 02:30:59,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:59,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:59,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:59,644 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:30:59,644 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:30:59,644 INFO L794 eck$LassoCheckResult]: Stem: 817#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 813#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 814#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 815#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 816#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 820#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 821#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 828#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 824#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 825#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 818#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 819#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 822#L559-2 [2019-01-14 02:30:59,644 INFO L796 eck$LassoCheckResult]: Loop: 822#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 823#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 830#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 829#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 827#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 822#L559-2 [2019-01-14 02:30:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288219, now seen corresponding path program 2 times [2019-01-14 02:30:59,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:59,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:59,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:59,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:59,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:00,151 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2019-01-14 02:31:00,414 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2019-01-14 02:31:00,526 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-01-14 02:31:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:00,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:31:00,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:31:00,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:31:00,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:31:00,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:31:00,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:00,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:00,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:31:00,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:00,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:00,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:31:00,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-01-14 02:31:00,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:31:00,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-01-14 02:31:00,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:31:00,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-14 02:31:00,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:31:00,823 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,838 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,846 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:00,879 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:85, output treesize:26 [2019-01-14 02:31:01,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2019-01-14 02:31:01,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,250 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 32 treesize of output 23 [2019-01-14 02:31:01,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2019-01-14 02:31:01,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2019-01-14 02:31:01,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:01,365 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 35 [2019-01-14 02:31:01,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:31:01,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:31:01,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:43 [2019-01-14 02:31:01,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2019-01-14 02:31:01,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 02:31:01,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2019-01-14 02:31:01,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:01,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:9 [2019-01-14 02:31:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:31:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-01-14 02:31:01,505 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:31:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash 61511628, now seen corresponding path program 4 times [2019-01-14 02:31:01,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:01,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:01,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:01,656 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-14 02:31:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 02:31:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-01-14 02:31:01,699 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 17 states. [2019-01-14 02:31:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:01,972 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-14 02:31:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:31:01,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-01-14 02:31:01,975 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:01,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-01-14 02:31:01,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:31:01,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:31:01,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:31:01,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:01,976 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:01,976 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:01,976 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:01,976 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:31:01,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:31:01,976 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:01,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:31:01,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:31:01 BoogieIcfgContainer [2019-01-14 02:31:01,983 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:31:01,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:31:01,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:31:01,984 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:31:01,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:39" (3/4) ... [2019-01-14 02:31:01,989 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:31:01,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:31:01,990 INFO L168 Benchmark]: Toolchain (without parser) took 24197.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -262.9 MB). Peak memory consumption was 114.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:01,990 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:01,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:01,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:01,991 INFO L168 Benchmark]: Boogie Preprocessor took 28.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:01,992 INFO L168 Benchmark]: RCFGBuilder took 503.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:01,992 INFO L168 Benchmark]: BuchiAutomizer took 22917.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.4 MB). Peak memory consumption was 128.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:01,992 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:01,995 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.17 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 677.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 503.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22917.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.4 MB). Peak memory consumption was 128.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 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[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.1s. Construction of modules took 0.4s. Büchi inclusion checks took 6.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 125 SDslu, 38 SDs, 0 SdLazy, 219 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital560 mio100 ax104 hnf100 lsp94 ukn47 mio100 lsp36 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf298 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 78ms 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...