./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:46:08,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:46:08,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:46:08,971 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:46:08,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:46:08,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:46:08,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:46:08,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:46:08,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:46:08,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:46:08,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:46:08,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:46:08,981 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:46:08,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:46:08,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:46:08,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:46:08,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:46:08,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:46:08,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:46:08,992 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:46:08,993 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:46:08,995 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:46:08,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:46:08,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:46:08,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:46:08,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:46:09,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:46:09,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:46:09,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:46:09,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:46:09,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:46:09,006 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:46:09,006 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:46:09,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:46:09,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:46:09,009 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:46:09,009 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:46:09,031 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:46:09,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:46:09,034 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:46:09,034 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:46:09,034 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:46:09,034 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:46:09,034 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:46:09,039 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:46:09,040 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:46:09,040 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:46:09,040 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:46:09,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:46:09,040 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:46:09,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:46:09,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:46:09,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:46:09,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:46:09,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:46:09,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:46:09,043 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:46:09,044 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:46:09,044 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:46:09,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:46:09,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:46:09,044 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:46:09,046 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:46:09,047 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:46:09,047 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:46:09,049 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:46:09,049 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 -> 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 [2019-01-01 21:46:09,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:46:09,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:46:09,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:46:09,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:46:09,126 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:46:09,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2019-01-01 21:46:09,204 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8b6d001/aaef963181a8442f87e2b67c14a67b51/FLAG656f48f71 [2019-01-01 21:46:09,736 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:46:09,737 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2019-01-01 21:46:09,766 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8b6d001/aaef963181a8442f87e2b67c14a67b51/FLAG656f48f71 [2019-01-01 21:46:09,998 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8b6d001/aaef963181a8442f87e2b67c14a67b51 [2019-01-01 21:46:10,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:46:10,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:46:10,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:46:10,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:46:10,010 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:46:10,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506ce86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10, skipping insertion in model container [2019-01-01 21:46:10,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:46:10,078 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:46:10,472 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:46:10,492 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:46:10,629 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:46:10,683 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:46:10,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10 WrapperNode [2019-01-01 21:46:10,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:46:10,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:46:10,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:46:10,685 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:46:10,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:46:10,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:46:10,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:46:10,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:46:10,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... [2019-01-01 21:46:10,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:46:10,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:46:10,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:46:10,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:46:10,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:46:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:46:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:46:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:46:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:46:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:46:11,246 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:46:11,247 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:46:11,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:46:11 BoogieIcfgContainer [2019-01-01 21:46:11,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:46:11,248 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:46:11,248 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:46:11,252 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:46:11,253 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:46:11,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:46:10" (1/3) ... [2019-01-01 21:46:11,254 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@676acc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:46:11, skipping insertion in model container [2019-01-01 21:46:11,255 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:46:11,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:10" (2/3) ... [2019-01-01 21:46:11,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@676acc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:46:11, skipping insertion in model container [2019-01-01 21:46:11,256 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:46:11,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:46:11" (3/3) ... [2019-01-01 21:46:11,259 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca_true-termination.c.i [2019-01-01 21:46:11,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:46:11,319 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:46:11,319 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:46:11,319 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:46:11,319 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:46:11,319 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:46:11,319 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:46:11,320 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:46:11,320 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:46:11,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:46:11,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:11,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:11,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:11,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:46:11,363 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:46:11,363 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:46:11,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:46:11,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:11,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:11,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:11,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:46:11,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:46:11,375 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 12#L558-4true [2019-01-01 21:46:11,375 INFO L796 eck$LassoCheckResult]: Loop: 12#L558-4true call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 6#L558true assume !main_#t~short10; 9#L558-2true assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 12#L558-4true [2019-01-01 21:46:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:46:11,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-01-01 21:46:11,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:11,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:46:11,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:46:11,673 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:46:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:46:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:46:11,692 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-01-01 21:46:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:46:11,732 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-01 21:46:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:46:11,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:46:11,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:11,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 6 states and 7 transitions. [2019-01-01 21:46:11,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:46:11,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:46:11,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-01-01 21:46:11,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:46:11,744 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:46:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-01-01 21:46:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-01 21:46:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:46:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:46:11,775 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:46:11,775 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:46:11,775 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:46:11,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-01 21:46:11,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:11,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:11,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:11,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:46:11,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:46:11,777 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 31#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 32#L558-4 [2019-01-01 21:46:11,778 INFO L796 eck$LassoCheckResult]: Loop: 32#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 33#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 34#L558-2 assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 32#L558-4 [2019-01-01 21:46:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-01 21:46:11,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-01-01 21:46:11,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-01-01 21:46:11,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:12,623 WARN L181 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-01 21:46:12,824 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 21:46:13,783 WARN L181 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-01-01 21:46:14,042 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-01 21:46:14,060 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:14,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:14,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:14,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:14,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:14,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:14,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:14,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:14,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:46:14,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:14,063 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:14,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:14,930 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-01-01 21:46:15,348 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-01 21:46:15,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-01 21:46:15,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:15,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:15,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:15,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:15,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-01 21:46:15,621 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-01 21:46:19,827 WARN L181 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-01 21:46:19,885 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:19,890 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:19,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:19,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:19,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:19,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:19,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:19,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:19,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:19,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:19,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:19,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:19,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:19,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:19,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:19,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:19,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:19,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:19,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:19,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:19,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:19,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:19,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:19,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:19,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:19,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:19,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:19,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:19,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:19,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:19,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:19,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:19,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:19,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:19,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:19,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:19,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:20,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:20,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:20,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:20,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:20,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:20,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:20,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:20,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:20,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:20,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:20,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:20,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:20,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:20,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:20,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:20,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:20,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:20,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:20,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:20,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:20,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:20,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:20,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:20,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:20,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:20,074 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:20,076 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:46:20,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:20,085 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:46:20,090 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:20,091 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] [2019-01-01 21:46:20,338 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-01-01 21:46:20,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:20,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:20,463 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-01-01 21:46:20,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2019-01-01 21:46:20,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 35 [2019-01-01 21:46:20,686 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 21:46:20,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-01 21:46:20,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-01-01 21:46:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:21,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:21,361 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-01 21:46:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:21,367 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:46:21,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-01 21:46:21,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 12 states and 14 transitions. Complement of second has 7 states. [2019-01-01 21:46:21,675 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-01 21:46:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:46:21,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:46:21,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:46:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:46:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:21,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-01 21:46:21,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:21,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-01-01 21:46:21,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:46:21,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:46:21,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-01-01 21:46:21,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:46:21,683 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:46:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-01-01 21:46:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-01 21:46:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:46:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-01 21:46:21,684 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:46:21,684 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:46:21,684 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:46:21,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-01-01 21:46:21,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:46:21,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:21,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:21,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:46:21,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:46:21,685 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 258#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 259#L558-4 [2019-01-01 21:46:21,686 INFO L796 eck$LassoCheckResult]: Loop: 259#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 260#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 261#L558-2 assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 259#L558-4 [2019-01-01 21:46:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:21,686 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-01 21:46:21,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:21,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:21,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:21,712 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 2 times [2019-01-01 21:46:21,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:21,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:21,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:21,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash 889511698, now seen corresponding path program 1 times [2019-01-01 21:46:21,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:21,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:21,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:22,525 WARN L181 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-01 21:46:22,969 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-01-01 21:46:23,142 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 21:46:23,146 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:23,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:23,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:23,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:23,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:23,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:23,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:23,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:23,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:46:23,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:23,148 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:23,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:23,721 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-01-01 21:46:23,911 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-01 21:46:27,814 WARN L181 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-01 21:46:27,858 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:27,858 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:27,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:27,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:27,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,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-01 21:46:27,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:27,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:27,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:27,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:27,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:27,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:27,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:27,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:27,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:27,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:27,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:27,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:27,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:27,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:27,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:27,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:27,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:27,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:27,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:27,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:27,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:27,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:28,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:28,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:28,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:28,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:28,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:28,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:28,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:28,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:28,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:28,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:28,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:28,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:28,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:28,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:28,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:28,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:28,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:28,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:28,049 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:28,059 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:46:28,060 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:46:28,060 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:28,061 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:46:28,061 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:28,061 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2019-01-01 21:46:28,329 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2019-01-01 21:46:28,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:28,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:28,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:28,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:28,424 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 34 treesize of output 43 [2019-01-01 21:46:28,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:28,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:28,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 [2019-01-01 21:46:28,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 45 [2019-01-01 21:46:28,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:28,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:28,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:28,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:28,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-01 21:46:28,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-01-01 21:46:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:28,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:28,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:46:28,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-01-01 21:46:28,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-01-01 21:46:28,933 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-01 21:46:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-01 21:46:28,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:46:28,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:28,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:46:28,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:28,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:46:28,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:28,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:46:28,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:46:28,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-01 21:46:28,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:46:28,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:46:28,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:46:28,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:46:28,937 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:28,937 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:28,937 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:28,937 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:46:28,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:46:28,938 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:46:28,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:46:28,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:46:28 BoogieIcfgContainer [2019-01-01 21:46:28,944 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:46:28,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:46:28,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:46:28,945 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:46:28,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:46:11" (3/4) ... [2019-01-01 21:46:28,949 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:46:28,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:46:28,950 INFO L168 Benchmark]: Toolchain (without parser) took 18947.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -85.1 MB). Peak memory consumption was 262.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:28,951 INFO L168 Benchmark]: CDTParser took 3.05 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:28,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:28,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:28,953 INFO L168 Benchmark]: Boogie Preprocessor took 28.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:28,954 INFO L168 Benchmark]: RCFGBuilder took 471.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:28,954 INFO L168 Benchmark]: BuchiAutomizer took 17696.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 274.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:28,955 INFO L168 Benchmark]: Witness Printer took 4.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:28,960 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.05 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 679.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 471.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17696.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 274.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 15.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 13 SDslu, 8 SDs, 0 SdLazy, 24 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax104 hnf100 lsp90 ukn58 mio100 lsp35 div100 bol100 ite100 ukn100 eq189 hnf88 smp98 dnf1799 smp89 tf100 neg91 sie128 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...