./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 9a031a295ba45c7116aee95a6abc238e63986cbf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:56:40,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:56:40,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:56:40,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:56:40,842 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:56:40,843 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:56:40,846 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:56:40,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:56:40,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:56:40,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:56:40,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:56:40,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:56:40,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:56:40,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:56:40,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:56:40,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:56:40,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:56:40,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:56:40,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:56:40,864 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:56:40,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:56:40,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:56:40,870 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:56:40,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:56:40,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:56:40,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:56:40,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:56:40,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:56:40,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:56:40,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:56:40,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:56:40,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:56:40,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:56:40,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:56:40,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:56:40,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:56:40,885 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:56:40,903 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:56:40,903 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:56:40,906 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:56:40,906 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:56:40,906 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:56:40,906 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:56:40,907 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:56:40,907 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:56:40,907 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:56:40,907 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:56:40,907 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:56:40,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:56:40,908 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:56:40,908 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:56:40,908 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:56:40,908 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:56:40,908 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:56:40,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:56:40,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:56:40,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:56:40,912 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:56:40,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:56:40,912 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:56:40,912 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:56:40,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:56:40,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:56:40,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:56:40,913 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:56:40,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:56:40,914 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:56:40,916 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:56:40,917 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:56:40,917 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a031a295ba45c7116aee95a6abc238e63986cbf [2019-01-14 04:56:40,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:56:40,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:56:41,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:56:41,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:56:41,002 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:56:41,003 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:41,075 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e8022a6/032250cae14446919856f7f8a2b75a4c/FLAGdb1cd5ce4 [2019-01-14 04:56:41,592 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:56:41,593 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:41,611 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e8022a6/032250cae14446919856f7f8a2b75a4c/FLAGdb1cd5ce4 [2019-01-14 04:56:41,900 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e8022a6/032250cae14446919856f7f8a2b75a4c [2019-01-14 04:56:41,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:56:41,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:56:41,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:41,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:56:41,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:56:41,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:41" (1/1) ... [2019-01-14 04:56:41,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238ff1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:41, skipping insertion in model container [2019-01-14 04:56:41,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:41" (1/1) ... [2019-01-14 04:56:41,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:56:41,984 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:56:42,297 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:42,311 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:56:42,456 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:42,521 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:56:42,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42 WrapperNode [2019-01-14 04:56:42,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:42,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:42,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:56:42,523 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:56:42,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:42,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:56:42,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:56:42,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:56:42,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... [2019-01-14 04:56:42,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:56:42,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:56:42,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:56:42,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:56:42,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:56:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:56:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:56:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:56:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:56:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:56:43,008 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:56:43,008 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:56:43,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:43 BoogieIcfgContainer [2019-01-14 04:56:43,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:56:43,010 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:56:43,011 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:56:43,014 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:56:43,015 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:43,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:56:41" (1/3) ... [2019-01-14 04:56:43,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ad73d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:43, skipping insertion in model container [2019-01-14 04:56:43,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:43,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:42" (2/3) ... [2019-01-14 04:56:43,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ad73d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:43, skipping insertion in model container [2019-01-14 04:56:43,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:43,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:43" (3/3) ... [2019-01-14 04:56:43,020 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:43,081 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:56:43,082 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:56:43,082 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:56:43,082 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:56:43,082 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:56:43,082 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:56:43,083 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:56:43,083 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:56:43,083 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:56:43,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:56:43,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:56:43,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:43,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:43,127 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:43,127 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:43,127 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:56:43,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:56:43,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:56:43,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:43,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:43,130 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:43,130 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:43,139 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L554true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9#L554-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 11#L544-3true [2019-01-14 04:56:43,139 INFO L796 eck$LassoCheckResult]: Loop: 11#L544-3true assume !!(test_fun_~i~0 < test_fun_~N); 6#L545-3true assume !true; 7#L544-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L544-3true [2019-01-14 04:56:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 04:56:43,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:43,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:43,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:43,274 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-01-14 04:56:43,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:43,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:43,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:43,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:43,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:43,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:56:43,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:56:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:56:43,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:56:43,336 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-14 04:56:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:43,344 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-14 04:56:43,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:56:43,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-14 04:56:43,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:56:43,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-01-14 04:56:43,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:56:43,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 04:56:43,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-14 04:56:43,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:43,357 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 04:56:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-14 04:56:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 04:56:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 04:56:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-14 04:56:43,395 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 04:56:43,395 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 04:56:43,396 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:56:43,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-14 04:56:43,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:56:43,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:43,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:43,400 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:43,400 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:56:43,400 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 39#L544-3 [2019-01-14 04:56:43,401 INFO L796 eck$LassoCheckResult]: Loop: 39#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 36#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 37#L545-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 38#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 39#L544-3 [2019-01-14 04:56:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 04:56:43,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:43,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:43,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-01-14 04:56:43,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:43,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:43,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-01-14 04:56:43,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:43,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:43,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:43,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:43,768 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:56:44,190 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 04:56:44,317 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 04:56:44,329 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:44,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:44,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:44,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:44,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:44,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:44,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:44,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:44,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:56:44,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:44,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:44,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:44,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:44,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:44,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:44,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:44,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:44,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:44,781 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 04:56:45,031 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 04:56:45,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:45,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:45,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:45,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:45,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:45,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:45,679 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:45,686 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:45,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:45,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:45,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:45,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:45,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:45,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:45,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:45,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:45,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:45,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:45,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:45,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:45,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:45,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:45,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:45,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:45,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:45,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:45,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:45,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:45,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:45,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:45,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:45,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:45,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:45,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:45,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:45,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:45,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:45,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:45,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:45,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:45,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:45,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:45,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:45,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:45,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:45,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:45,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:45,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:45,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:45,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:45,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:45,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:45,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:45,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:45,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:45,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:45,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:45,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:45,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:45,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:45,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:45,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:45,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:45,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:45,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:45,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:45,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:45,837 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:45,904 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:56:45,905 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 04:56:45,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:45,912 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:45,912 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:45,914 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-01-14 04:56:45,946 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:56:46,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:46,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:46,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:46,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:46,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 04:56:46,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-01-14 04:56:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 04:56:46,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 04:56:46,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:46,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 04:56:46,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:46,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 04:56:46,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:46,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-14 04:56:46,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:46,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-14 04:56:46,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 04:56:46,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 04:56:46,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 04:56:46,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:46,143 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 04:56:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 04:56:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 04:56:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 04:56:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-14 04:56:46,145 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 04:56:46,145 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 04:56:46,145 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:56:46,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-14 04:56:46,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:46,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:46,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:46,146 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:56:46,147 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:46,147 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 112#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 120#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 121#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L545-3 [2019-01-14 04:56:46,147 INFO L796 eck$LassoCheckResult]: Loop: 113#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 114#L545-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 113#L545-3 [2019-01-14 04:56:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 04:56:46,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-14 04:56:46,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-14 04:56:46,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:46,609 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-14 04:56:46,703 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:46,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:46,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:46,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:46,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:46,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:46,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:46,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:46,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:56:46,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:46,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:46,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,891 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 04:56:46,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:46,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:47,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:47,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:47,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:47,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:47,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:47,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:47,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:47,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:47,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:47,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:47,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:47,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:47,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:47,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:47,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:47,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:47,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,493 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:56:47,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,497 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:56:47,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:47,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:47,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:47,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:47,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:47,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:47,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:47,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:47,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:47,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:47,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:47,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:47,546 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:47,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:47,554 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:56:47,554 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:47,555 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:56:47,555 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:47,555 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-01-14 04:56:47,644 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:56:47,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:47,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:47,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:47,943 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:47,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 04:56:47,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2019-01-14 04:56:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 04:56:47,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 04:56:47,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:47,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:56:47,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:47,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 04:56:47,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:47,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-14 04:56:47,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:47,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-01-14 04:56:47,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 04:56:47,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 04:56:47,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-14 04:56:47,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:47,975 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 04:56:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-14 04:56:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 04:56:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 04:56:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-14 04:56:47,979 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 04:56:47,979 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 04:56:47,979 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:56:47,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-14 04:56:47,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:47,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:47,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:47,981 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:47,981 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:47,982 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 200#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 208#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 209#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 210#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 212#L545-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 205#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 206#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 201#L545-3 [2019-01-14 04:56:47,982 INFO L796 eck$LassoCheckResult]: Loop: 201#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 202#L545-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 201#L545-3 [2019-01-14 04:56:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-01-14 04:56:47,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:47,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:47,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-14 04:56:48,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:48,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:48,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-01-14 04:56:48,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:48,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:48,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:48,480 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-01-14 04:56:48,540 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:48,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:48,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:48,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:48,541 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:48,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:48,541 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:48,541 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:48,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-14 04:56:48,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:48,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:48,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,713 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-14 04:56:49,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:49,237 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:49,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,279 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:56:49,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,282 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:56:49,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,344 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:49,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:49,346 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:56:49,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:49,346 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:56:49,351 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:49,351 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2019-01-14 04:56:49,460 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:56:49,475 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:49,617 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:49,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 04:56:49,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-01-14 04:56:49,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 04:56:49,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:56:49,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,686 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:49,741 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:49,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 04:56:49,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-01-14 04:56:49,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 04:56:49,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:56:49,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,767 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:49,817 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:49,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 04:56:49,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2019-01-14 04:56:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 04:56:49,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:56:49,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 04:56:49,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 04:56:49,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-14 04:56:49,848 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:49,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-01-14 04:56:49,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:56:49,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:56:49,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:56:49,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:49,849 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:49,849 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:49,849 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:49,849 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:56:49,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:56:49,849 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:49,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:56:49,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:56:49 BoogieIcfgContainer [2019-01-14 04:56:49,859 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:56:49,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:56:49,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:56:49,860 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:56:49,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:43" (3/4) ... [2019-01-14 04:56:49,868 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:56:49,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:56:49,869 INFO L168 Benchmark]: Toolchain (without parser) took 7962.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -63.6 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:49,871 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:49,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:49,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:49,873 INFO L168 Benchmark]: Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:49,873 INFO L168 Benchmark]: RCFGBuilder took 409.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:49,874 INFO L168 Benchmark]: BuchiAutomizer took 6848.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 163.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:49,875 INFO L168 Benchmark]: Witness Printer took 8.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:49,880 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 613.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6848.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 163.6 MB. Max. memory is 11.5 GB. * Witness Printer took 8.43 ms. Allocated memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 1 SDs, 0 SdLazy, 43 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf98 lsp91 ukn80 mio100 lsp57 div100 bol100 ite100 ukn100 eq176 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...