./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer --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 c721a987debd4748cfed075333b7fa46c2d0f9ef ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:02:23,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:02:23,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:02:23,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:02:23,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:02:23,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:02:23,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:02:23,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:02:23,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:02:23,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:02:23,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:02:23,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:02:23,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:02:23,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:02:23,898 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:02:23,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:02:23,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:02:23,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:02:23,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:02:23,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:02:23,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:02:23,903 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:02:23,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:02:23,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:02:23,904 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:02:23,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:02:23,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:02:23,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:02:23,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:02:23,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:02:23,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:02:23,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:02:23,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:02:23,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:02:23,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:02:23,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:02:23,908 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-03 01:02:23,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:02:23,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:02:23,917 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:02:23,917 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:02:23,917 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 01:02:23,918 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-03 01:02:23,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:02:23,918 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-03 01:02:23,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:02:23,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:02:23,920 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-03 01:02:23,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:02:23,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-03 01:02:23,920 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-03 01:02:23,920 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-03 01:02:23,920 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer 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 -> c721a987debd4748cfed075333b7fa46c2d0f9ef [2018-12-03 01:02:23,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:02:23,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:02:23,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:02:23,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:02:23,950 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:02:23,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i [2018-12-03 01:02:23,986 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/data/e26a00c27/bd139057d7454b19bf56af78fce0b8e1/FLAG4ff956e1e [2018-12-03 01:02:24,453 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:02:24,453 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i [2018-12-03 01:02:24,457 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/data/e26a00c27/bd139057d7454b19bf56af78fce0b8e1/FLAG4ff956e1e [2018-12-03 01:02:24,467 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/data/e26a00c27/bd139057d7454b19bf56af78fce0b8e1 [2018-12-03 01:02:24,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:02:24,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:02:24,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:02:24,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:02:24,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:02:24,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24, skipping insertion in model container [2018-12-03 01:02:24,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:02:24,488 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:02:24,579 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:02:24,585 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:02:24,597 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:02:24,606 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:02:24,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24 WrapperNode [2018-12-03 01:02:24,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:02:24,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:02:24,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:02:24,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:02:24,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:02:24,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:02:24,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:02:24,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:02:24,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... [2018-12-03 01:02:24,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:02:24,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:02:24,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:02:24,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:02:24,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/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 [2018-12-03 01:02:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:02:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:02:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:02:24,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:02:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 01:02:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:02:24,909 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:02:24,909 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-03 01:02:24,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:02:24 BoogieIcfgContainer [2018-12-03 01:02:24,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:02:24,910 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-03 01:02:24,910 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-03 01:02:24,913 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-03 01:02:24,914 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 01:02:24,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 03.12 01:02:24" (1/3) ... [2018-12-03 01:02:24,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65a2b027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 01:02:24, skipping insertion in model container [2018-12-03 01:02:24,915 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 01:02:24,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:24" (2/3) ... [2018-12-03 01:02:24,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65a2b027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 01:02:24, skipping insertion in model container [2018-12-03 01:02:24,915 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 01:02:24,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:02:24" (3/3) ... [2018-12-03 01:02:24,917 INFO L375 chiAutomizerObserver]: Analyzing ICFG max_true-unreach-call_true-termination.i [2018-12-03 01:02:24,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 01:02:24,963 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-03 01:02:24,963 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-03 01:02:24,963 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-03 01:02:24,963 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:02:24,963 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:02:24,963 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-03 01:02:24,964 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:02:24,964 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-03 01:02:24,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-12-03 01:02:24,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-03 01:02:24,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:24,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:24,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-03 01:02:24,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:24,990 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-03 01:02:24,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-12-03 01:02:24,992 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-03 01:02:24,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:24,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:24,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-03 01:02:24,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:24,997 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 8#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6#L11-3true [2018-12-03 01:02:24,997 INFO L796 eck$LassoCheckResult]: Loop: 6#L11-3true assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 12#L12true assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 11#L12-2true max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 7#L11-2true max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6#L11-3true [2018-12-03 01:02:25,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-12-03 01:02:25,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:25,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2018-12-03 01:02:25,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:25,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:25,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2018-12-03 01:02:25,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:25,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:25,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,210 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:02:25,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:02:25,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:02:25,210 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:02:25,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 01:02:25,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:02:25,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:02:25,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:02:25,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-03 01:02:25,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:02:25,211 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:02:25,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:25,491 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:02:25,494 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 01:02:25,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:25,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,501 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 [2018-12-03 01:02:25,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,504 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 [2018-12-03 01:02:25,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,507 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 [2018-12-03 01:02:25,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,510 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 [2018-12-03 01:02:25,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,512 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 [2018-12-03 01:02:25,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,515 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 [2018-12-03 01:02:25,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,517 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 [2018-12-03 01:02:25,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:25,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:25,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,522 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 [2018-12-03 01:02:25,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:25,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,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 [2018-12-03 01:02:25,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,527 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 [2018-12-03 01:02:25,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:25,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:25,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,531 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 [2018-12-03 01:02:25,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,534 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 [2018-12-03 01:02:25,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:25,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:25,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:25,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:25,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,538 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 [2018-12-03 01:02:25,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:25,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:25,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,555 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 [2018-12-03 01:02:25,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,556 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 01:02:25,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,558 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:02:25,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:25,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,569 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 [2018-12-03 01:02:25,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:25,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:25,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:25,580 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 [2018-12-03 01:02:25,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:25,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:25,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:25,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:25,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:25,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:25,612 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 01:02:25,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-03 01:02:25,625 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-03 01:02:25,627 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 01:02:25,628 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-03 01:02:25,629 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 01:02:25,629 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_max_~x.base)_1, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 1*v_rep(select #length ULTIMATE.start_max_~x.base)_1 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2018-12-03 01:02:25,637 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-03 01:02:25,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-03 01:02:25,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:25,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:25,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:25,707 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 [2018-12-03 01:02:25,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2018-12-03 01:02:25,744 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 63 states and 87 transitions. Complement of second has 8 states. [2018-12-03 01:02:25,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-03 01:02:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-03 01:02:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-12-03 01:02:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-03 01:02:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:25,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-03 01:02:25,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:25,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2018-12-03 01:02:25,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:25,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2018-12-03 01:02:25,750 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:25,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2018-12-03 01:02:25,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-03 01:02:25,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-03 01:02:25,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2018-12-03 01:02:25,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:02:25,754 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-12-03 01:02:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2018-12-03 01:02:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 01:02:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 01:02:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-12-03 01:02:25,771 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-12-03 01:02:25,771 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-12-03 01:02:25,771 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-03 01:02:25,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2018-12-03 01:02:25,771 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:25,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:25,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:25,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-03 01:02:25,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:25,772 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 171#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 169#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 164#L11-3 assume !(max_~i~0 < ~N~0); 160#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 161#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 176#L11-8 [2018-12-03 01:02:25,772 INFO L796 eck$LassoCheckResult]: Loop: 176#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 168#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 158#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 159#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 176#L11-8 [2018-12-03 01:02:25,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2018-12-03 01:02:25,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:25,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:25,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:02:25,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:02:25,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-03 01:02:25,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2018-12-03 01:02:25,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:25,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:02:25,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:02:25,850 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-03 01:02:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:02:25,878 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-12-03 01:02:25,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:02:25,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-12-03 01:02:25,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:25,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2018-12-03 01:02:25,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-03 01:02:25,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-03 01:02:25,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2018-12-03 01:02:25,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:02:25,880 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-03 01:02:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2018-12-03 01:02:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-12-03 01:02:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 01:02:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-03 01:02:25,882 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-03 01:02:25,882 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-03 01:02:25,882 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-03 01:02:25,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-03 01:02:25,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:25,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:25,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:25,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:25,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:25,883 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 226#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 224#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 219#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 220#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 227#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 222#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 221#L11-3 assume !(max_~i~0 < ~N~0); 215#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 216#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 231#L11-8 [2018-12-03 01:02:25,883 INFO L796 eck$LassoCheckResult]: Loop: 231#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 223#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 213#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 214#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 231#L11-8 [2018-12-03 01:02:25,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2018-12-03 01:02:25,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:25,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:25,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:02:25,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:02:25,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:25,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:25,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:02:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-03 01:02:25,953 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-03 01:02:25,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2018-12-03 01:02:25,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:25,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:02:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:02:25,987 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-12-03 01:02:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:02:26,031 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-12-03 01:02:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:02:26,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2018-12-03 01:02:26,032 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:26,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2018-12-03 01:02:26,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-03 01:02:26,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-03 01:02:26,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2018-12-03 01:02:26,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:02:26,034 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-03 01:02:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2018-12-03 01:02:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-12-03 01:02:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 01:02:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-12-03 01:02:26,036 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-03 01:02:26,036 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-03 01:02:26,036 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-03 01:02:26,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-12-03 01:02:26,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:26,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:26,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:26,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:26,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:26,038 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 315#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 314#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 308#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 309#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 324#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 312#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 310#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 311#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 317#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 318#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 323#L11-3 assume !(max_~i~0 < ~N~0); 302#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 303#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 322#L11-8 [2018-12-03 01:02:26,038 INFO L796 eck$LassoCheckResult]: Loop: 322#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 313#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 304#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 305#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 322#L11-8 [2018-12-03 01:02:26,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2018-12-03 01:02:26,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:26,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:26,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:26,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2018-12-03 01:02:26,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:26,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:26,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:26,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2018-12-03 01:02:26,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:26,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:26,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:26,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:02:26,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:02:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:26,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:26,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-03 01:02:26,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:02:26,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-12-03 01:02:26,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:02:26,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-03 01:02:26,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:02:26,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:26,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:26,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:26,455 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2018-12-03 01:02:26,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-03 01:02:26,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 01:02:26,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:02:26,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:26,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:26,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-03 01:02:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:26,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:02:26,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-12-03 01:02:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 01:02:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:02:26,544 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 18 states. [2018-12-03 01:02:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:02:27,520 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-12-03 01:02:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 01:02:27,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 126 transitions. [2018-12-03 01:02:27,522 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 22 [2018-12-03 01:02:27,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 126 transitions. [2018-12-03 01:02:27,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-12-03 01:02:27,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-12-03 01:02:27,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 126 transitions. [2018-12-03 01:02:27,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:02:27,524 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-12-03 01:02:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 126 transitions. [2018-12-03 01:02:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 39. [2018-12-03 01:02:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 01:02:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-03 01:02:27,527 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-03 01:02:27,528 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-03 01:02:27,528 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-03 01:02:27,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2018-12-03 01:02:27,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:27,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:27,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:27,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:27,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:27,529 INFO L794 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 547#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 545#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 539#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 540#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 548#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 549#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 567#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 559#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 562#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 563#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 557#L11-3 assume !(max_~i~0 < ~N~0); 558#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 556#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 554#L11-8 [2018-12-03 01:02:27,529 INFO L796 eck$LassoCheckResult]: Loop: 554#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 555#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 535#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 536#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 554#L11-8 [2018-12-03 01:02:27,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2018-12-03 01:02:27,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:27,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:27,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:27,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2018-12-03 01:02:27,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:27,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:27,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2018-12-03 01:02:27,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:27,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:27,807 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-12-03 01:02:27,928 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-03 01:02:27,930 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:02:27,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:02:27,930 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:02:27,930 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:02:27,930 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 01:02:27,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:02:27,930 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:02:27,930 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:02:27,930 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-12-03 01:02:27,930 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:02:27,931 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:02:27,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:27,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,147 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-12-03 01:02:28,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:28,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:02:28,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 01:02:28,368 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 [2018-12-03 01:02:28,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,370 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 [2018-12-03 01:02:28,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,371 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 [2018-12-03 01:02:28,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,372 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 [2018-12-03 01:02:28,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,373 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 [2018-12-03 01:02:28,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,374 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 [2018-12-03 01:02:28,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:28,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,376 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 [2018-12-03 01:02:28,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,377 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 [2018-12-03 01:02:28,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,378 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 [2018-12-03 01:02:28,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:28,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,380 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 [2018-12-03 01:02:28,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:28,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:28,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:28,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,381 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 [2018-12-03 01:02:28,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:28,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,386 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 [2018-12-03 01:02:28,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:28,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,389 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 [2018-12-03 01:02:28,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,390 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 01:02:28,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,391 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:02:28,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,393 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 [2018-12-03 01:02:28,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,394 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 01:02:28,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,394 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:02:28,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,397 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 [2018-12-03 01:02:28,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:28,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:28,399 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 [2018-12-03 01:02:28,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:28,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:28,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:28,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:28,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:28,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:28,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 01:02:28,419 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-03 01:02:28,419 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-03 01:02:28,420 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 01:02:28,420 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-03 01:02:28,420 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 01:02:28,420 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 3 Supporting invariants [-1*~N~0 + 2 >= 0] [2018-12-03 01:02:28,431 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-12-03 01:02:28,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:28,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:28,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:28,497 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-03 01:02:28,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-12-03 01:02:28,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 80 states and 109 transitions. Complement of second has 13 states. [2018-12-03 01:02:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-03 01:02:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 01:02:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-12-03 01:02:28,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-03 01:02:28,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:28,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 18 letters. Loop has 4 letters. [2018-12-03 01:02:28,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:28,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 14 letters. Loop has 8 letters. [2018-12-03 01:02:28,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:28,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 109 transitions. [2018-12-03 01:02:28,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-12-03 01:02:28,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 71 states and 94 transitions. [2018-12-03 01:02:28,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-03 01:02:28,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-12-03 01:02:28,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 94 transitions. [2018-12-03 01:02:28,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:02:28,562 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 94 transitions. [2018-12-03 01:02:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 94 transitions. [2018-12-03 01:02:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2018-12-03 01:02:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 01:02:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-12-03 01:02:28,564 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-12-03 01:02:28,564 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-12-03 01:02:28,564 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-03 01:02:28,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-12-03 01:02:28,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:28,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:28,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:28,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:28,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-03 01:02:28,565 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 791#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 790#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 782#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 783#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 821#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 819#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 817#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 815#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 813#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 812#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 810#L11-3 assume !(max_~i~0 < ~N~0); 808#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 806#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 804#L11-8 assume !(max_~i~0 < ~N~0); 797#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 798#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 780#L32-3 [2018-12-03 01:02:28,565 INFO L796 eck$LassoCheckResult]: Loop: 780#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 781#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 780#L32-3 [2018-12-03 01:02:28,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2018-12-03 01:02:28,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:28,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:28,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:28,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 01:02:28,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:02:28,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:02:28,582 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-03 01:02:28,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:28,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-12-03 01:02:28,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:28,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:02:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:02:28,609 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. cyclomatic complexity: 24 Second operand 4 states. [2018-12-03 01:02:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:02:28,628 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-12-03 01:02:28,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:02:28,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 86 transitions. [2018-12-03 01:02:28,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:28,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 86 transitions. [2018-12-03 01:02:28,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-12-03 01:02:28,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-12-03 01:02:28,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2018-12-03 01:02:28,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:02:28,630 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-12-03 01:02:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2018-12-03 01:02:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-12-03 01:02:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 01:02:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2018-12-03 01:02:28,632 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2018-12-03 01:02:28,632 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2018-12-03 01:02:28,632 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-03 01:02:28,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 73 transitions. [2018-12-03 01:02:28,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-03 01:02:28,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:28,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:28,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:28,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:28,633 INFO L794 eck$LassoCheckResult]: Stem: 926#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 924#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 922#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 914#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 915#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 951#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 950#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 949#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 948#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 945#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 944#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 943#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 940#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 942#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 941#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 939#L11-3 assume !(max_~i~0 < ~N~0); 938#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 937#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 936#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 935#L12-3 [2018-12-03 01:02:28,633 INFO L796 eck$LassoCheckResult]: Loop: 935#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 908#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 909#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 934#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 935#L12-3 [2018-12-03 01:02:28,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 209733900, now seen corresponding path program 1 times [2018-12-03 01:02:28,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2128124, now seen corresponding path program 5 times [2018-12-03 01:02:28,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:28,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:28,649 INFO L82 PathProgramCache]: Analyzing trace with hash -772848505, now seen corresponding path program 2 times [2018-12-03 01:02:28,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:28,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:28,993 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 134 [2018-12-03 01:02:29,170 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-03 01:02:29,171 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:02:29,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:02:29,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:02:29,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:02:29,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 01:02:29,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:02:29,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:02:29,172 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:02:29,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-03 01:02:29,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:02:29,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:02:29,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,366 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-12-03 01:02:29,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:29,611 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:02:29,611 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 01:02:29,611 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 [2018-12-03 01:02:29,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:29,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:29,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:29,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:29,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:29,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:29,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:29,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:29,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:29,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:29,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:29,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:29,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:29,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:29,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:29,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:29,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:29,614 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 [2018-12-03 01:02:29,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:29,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:29,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:29,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:29,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:29,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:29,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:29,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:29,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:29,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:29,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:29,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:29,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:29,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:29,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:29,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:29,617 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 [2018-12-03 01:02:29,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:29,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:29,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:29,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:29,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:29,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:29,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:29,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:29,619 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 [2018-12-03 01:02:29,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:29,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:29,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:29,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:29,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:29,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:29,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:29,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:29,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:29,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:29,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:29,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:29,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:29,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:29,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:29,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 01:02:29,660 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-03 01:02:29,660 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-03 01:02:29,660 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 01:02:29,661 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-03 01:02:29,661 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 01:02:29,661 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_max_~x.base)_3, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 1*v_rep(select #length ULTIMATE.start_max_~x.base)_3 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2018-12-03 01:02:29,670 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-03 01:02:29,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-03 01:02:29,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:29,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:29,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:29,703 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 [2018-12-03 01:02:29,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 73 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-12-03 01:02:29,724 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 73 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 71 states and 95 transitions. Complement of second has 7 states. [2018-12-03 01:02:29,724 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 [2018-12-03 01:02:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 01:02:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-03 01:02:29,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-03 01:02:29,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:29,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2018-12-03 01:02:29,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:29,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2018-12-03 01:02:29,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:29,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 95 transitions. [2018-12-03 01:02:29,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-03 01:02:29,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 65 states and 87 transitions. [2018-12-03 01:02:29,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-03 01:02:29,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-03 01:02:29,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 87 transitions. [2018-12-03 01:02:29,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 01:02:29,728 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-12-03 01:02:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 87 transitions. [2018-12-03 01:02:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-12-03 01:02:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 01:02:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2018-12-03 01:02:29,731 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2018-12-03 01:02:29,731 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2018-12-03 01:02:29,731 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-03 01:02:29,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2018-12-03 01:02:29,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-03 01:02:29,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:29,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:29,732 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:29,732 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-03 01:02:29,732 INFO L794 eck$LassoCheckResult]: Stem: 1163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1160#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1159#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1152#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1153#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1192#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1190#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1188#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1185#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1182#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1181#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1179#L11-3 assume !(max_~i~0 < ~N~0); 1180#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1169#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1166#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1167#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1146#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1147#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1170#L11-8 assume !(max_~i~0 < ~N~0); 1164#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1165#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1150#L32-3 [2018-12-03 01:02:29,733 INFO L796 eck$LassoCheckResult]: Loop: 1150#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1151#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1150#L32-3 [2018-12-03 01:02:29,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:29,733 INFO L82 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2018-12-03 01:02:29,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:29,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:29,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:29,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:29,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 01:02:29,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:02:29,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:02:29,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:29,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 01:02:29,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:02:29,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-03 01:02:29,815 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-03 01:02:29,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-12-03 01:02:29,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:29,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:29,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:29,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:02:29,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:02:29,843 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. cyclomatic complexity: 24 Second operand 7 states. [2018-12-03 01:02:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:02:29,887 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2018-12-03 01:02:29,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:02:29,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 104 transitions. [2018-12-03 01:02:29,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-03 01:02:29,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 96 transitions. [2018-12-03 01:02:29,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-03 01:02:29,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-12-03 01:02:29,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 96 transitions. [2018-12-03 01:02:29,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 01:02:29,890 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 96 transitions. [2018-12-03 01:02:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 96 transitions. [2018-12-03 01:02:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2018-12-03 01:02:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 01:02:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2018-12-03 01:02:29,892 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2018-12-03 01:02:29,892 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2018-12-03 01:02:29,892 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-03 01:02:29,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2018-12-03 01:02:29,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-03 01:02:29,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:29,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:29,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:29,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-03 01:02:29,894 INFO L794 eck$LassoCheckResult]: Stem: 1372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1370#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1368#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1360#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1361#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1371#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1364#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1365#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1405#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1394#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1402#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1400#L11-3 assume !(max_~i~0 < ~N~0); 1399#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1398#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1396#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1395#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1356#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1357#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1377#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1378#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1354#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1355#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1379#L11-8 assume !(max_~i~0 < ~N~0); 1374#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1375#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1358#L32-3 [2018-12-03 01:02:29,894 INFO L796 eck$LassoCheckResult]: Loop: 1358#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1359#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1358#L32-3 [2018-12-03 01:02:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2018-12-03 01:02:29,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:29,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:29,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:30,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:02:30,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ecf4142-bb3a-4089-bd10-148c6fe1fd0e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:02:30,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 01:02:30,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 01:02:30,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 01:02:30,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:30,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-12-03 01:02:30,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:02:30,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2018-12-03 01:02:30,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:02:30,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-03 01:02:30,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:02:30,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:30,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:30,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:30,357 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:19 [2018-12-03 01:02:30,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-03 01:02:30,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 01:02:30,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:02:30,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:30,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:02:30,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-03 01:02:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 01:02:30,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:02:30,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-12-03 01:02:30,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-03 01:02:30,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2018-12-03 01:02:30,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:30,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 01:02:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-03 01:02:30,466 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 21 Second operand 22 states. [2018-12-03 01:02:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:02:31,908 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2018-12-03 01:02:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 01:02:31,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 175 transitions. [2018-12-03 01:02:31,909 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-03 01:02:31,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 175 transitions. [2018-12-03 01:02:31,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-12-03 01:02:31,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-12-03 01:02:31,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 175 transitions. [2018-12-03 01:02:31,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 01:02:31,910 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 175 transitions. [2018-12-03 01:02:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 175 transitions. [2018-12-03 01:02:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2018-12-03 01:02:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 01:02:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-12-03 01:02:31,914 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-12-03 01:02:31,914 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-12-03 01:02:31,914 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-03 01:02:31,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 117 transitions. [2018-12-03 01:02:31,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-03 01:02:31,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:31,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:31,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:31,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-03 01:02:31,916 INFO L794 eck$LassoCheckResult]: Stem: 1718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1716#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1714#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1705#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1706#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1743#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1744#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1739#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1740#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1766#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1764#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1762#L11-3 assume !(max_~i~0 < ~N~0); 1759#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1757#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1755#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1753#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1751#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1750#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1724#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1725#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1746#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1726#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1727#L11-8 assume !(max_~i~0 < ~N~0); 1721#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1722#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1703#L32-3 [2018-12-03 01:02:31,916 INFO L796 eck$LassoCheckResult]: Loop: 1703#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1704#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1703#L32-3 [2018-12-03 01:02:31,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2068419783, now seen corresponding path program 1 times [2018-12-03 01:02:31,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:31,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:31,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2018-12-03 01:02:31,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:31,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:31,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:31,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash 818448475, now seen corresponding path program 1 times [2018-12-03 01:02:31,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:31,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:31,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:32,411 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 158 [2018-12-03 01:02:32,786 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2018-12-03 01:02:32,788 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:02:32,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:02:32,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:02:32,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:02:32,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 01:02:32,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:02:32,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:02:32,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:02:32,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration10_Lasso [2018-12-03 01:02:32,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:02:32,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:02:32,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:32,858 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 01:02:33,138 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-12-03 01:02:33,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:33,540 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-03 01:02:33,596 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:02:33,596 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 01:02:33,596 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 [2018-12-03 01:02:33,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:33,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:33,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:33,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,598 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 [2018-12-03 01:02:33,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:33,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:33,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:33,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:33,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:33,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,603 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 [2018-12-03 01:02:33,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:33,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:33,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:33,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,604 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 [2018-12-03 01:02:33,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:33,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,607 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 [2018-12-03 01:02:33,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:33,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:33,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:33,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:33,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:33,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:33,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:33,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,610 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 [2018-12-03 01:02:33,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:33,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:33,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:33,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:33,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:33,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,617 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 [2018-12-03 01:02:33,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,617 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 01:02:33,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,619 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:02:33,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,627 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 [2018-12-03 01:02:33,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:33,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:33,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:33,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,633 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 [2018-12-03 01:02:33,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,634 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 01:02:33,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,635 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:02:33,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:33,638 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 [2018-12-03 01:02:33,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:33,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:33,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:33,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:33,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:33,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:33,651 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 01:02:33,659 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-03 01:02:33,659 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-03 01:02:33,659 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 01:02:33,659 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-03 01:02:33,660 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 01:02:33,660 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#x~0.offset, ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_4) = -1*ULTIMATE.start_main_~#x~0.offset - 4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_4 Supporting invariants [] [2018-12-03 01:02:33,684 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-03 01:02:33,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-03 01:02:33,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:33,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:33,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:33,737 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 [2018-12-03 01:02:33,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 117 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-12-03 01:02:33,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 117 transitions. cyclomatic complexity: 33. Second operand 3 states. Result 101 states and 134 transitions. Complement of second has 6 states. [2018-12-03 01:02:33,751 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 [2018-12-03 01:02:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-03 01:02:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-12-03 01:02:33,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2018-12-03 01:02:33,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:33,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2018-12-03 01:02:33,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:33,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2018-12-03 01:02:33,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:33,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 134 transitions. [2018-12-03 01:02:33,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-03 01:02:33,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 92 states and 119 transitions. [2018-12-03 01:02:33,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-12-03 01:02:33,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-03 01:02:33,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 119 transitions. [2018-12-03 01:02:33,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 01:02:33,754 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-12-03 01:02:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 119 transitions. [2018-12-03 01:02:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 01:02:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 01:02:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2018-12-03 01:02:33,757 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-12-03 01:02:33,758 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-12-03 01:02:33,758 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-03 01:02:33,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2018-12-03 01:02:33,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-03 01:02:33,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:33,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:33,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:33,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:33,759 INFO L794 eck$LassoCheckResult]: Stem: 2051#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2049#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2046#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2039#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2040#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2092#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2091#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2090#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2089#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2087#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2084#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2080#L11-3 assume !(max_~i~0 < ~N~0); 2077#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2075#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2072#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2068#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2067#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2066#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2064#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2060#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2061#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2074#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2071#L11-8 assume !(max_~i~0 < ~N~0); 2052#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2053#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2035#L32-3 assume !(main_~i~1 < ~N~0 - 1); 2036#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2048#L11-13 [2018-12-03 01:02:33,759 INFO L796 eck$LassoCheckResult]: Loop: 2048#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2059#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2026#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2047#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2048#L11-13 [2018-12-03 01:02:33,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 818448417, now seen corresponding path program 1 times [2018-12-03 01:02:33,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:33,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 01:02:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:02:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:02:33,782 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-03 01:02:33,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2018-12-03 01:02:33,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:33,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:02:33,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:02:33,817 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. cyclomatic complexity: 34 Second operand 4 states. [2018-12-03 01:02:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:02:33,832 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2018-12-03 01:02:33,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:02:33,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2018-12-03 01:02:33,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-03 01:02:33,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 115 transitions. [2018-12-03 01:02:33,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-03 01:02:33,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-03 01:02:33,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 115 transitions. [2018-12-03 01:02:33,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-03 01:02:33,834 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-12-03 01:02:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 115 transitions. [2018-12-03 01:02:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-12-03 01:02:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 01:02:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-12-03 01:02:33,835 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-12-03 01:02:33,835 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-12-03 01:02:33,835 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-03 01:02:33,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 101 transitions. [2018-12-03 01:02:33,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-03 01:02:33,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:02:33,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:02:33,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:02:33,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:02:33,836 INFO L794 eck$LassoCheckResult]: Stem: 2238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2236#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2234#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2227#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2228#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2269#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2268#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2267#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2266#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2264#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2262#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2259#L11-3 assume !(max_~i~0 < ~N~0); 2257#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2255#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2253#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2251#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2220#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2221#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2249#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2248#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2218#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2219#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2246#L11-8 assume !(max_~i~0 < ~N~0); 2239#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2240#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2224#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 2225#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2226#L32-3 assume !(main_~i~1 < ~N~0 - 1); 2216#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2217#L11-13 [2018-12-03 01:02:33,836 INFO L796 eck$LassoCheckResult]: Loop: 2217#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2214#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2215#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 2235#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2217#L11-13 [2018-12-03 01:02:33,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:33,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2018-12-03 01:02:33,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:33,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:33,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2018-12-03 01:02:33,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:33,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:02:33,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:33,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2018-12-03 01:02:33,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:02:33,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:02:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:02:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:02:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:02:34,845 WARN L180 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 194 [2018-12-03 01:02:35,953 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-12-03 01:02:35,955 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:02:35,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:02:35,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:02:35,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:02:35,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 01:02:35,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:02:35,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:02:35,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:02:35,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-03 01:02:35,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:02:35,955 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:02:35,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:35,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,022 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 01:02:36,289 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2018-12-03 01:02:36,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:02:36,621 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-03 01:02:36,669 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:02:36,670 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 01:02:36,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:36,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,671 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 [2018-12-03 01:02:36,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:36,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,674 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 [2018-12-03 01:02:36,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,675 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 [2018-12-03 01:02:36,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:36,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,677 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 [2018-12-03 01:02:36,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,678 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 [2018-12-03 01:02:36,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:36,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,680 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 [2018-12-03 01:02:36,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,681 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 [2018-12-03 01:02:36,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:02:36,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:02:36,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:02:36,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,683 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 [2018-12-03 01:02:36,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:36,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,686 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 [2018-12-03 01:02:36,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,686 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 01:02:36,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,687 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:02:36,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,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 [2018-12-03 01:02:36,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:36,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,691 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 [2018-12-03 01:02:36,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:36,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:02:36,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,695 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-03 01:02:36,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,696 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:02:36,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,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 [2018-12-03 01:02:36,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:36,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:02:36,700 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 [2018-12-03 01:02:36,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:02:36,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:02:36,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:02:36,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:02:36,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:02:36,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-03 01:02:36,705 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-03 01:02:36,711 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-03 01:02:36,711 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-03 01:02:36,712 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-03 01:02:36,712 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-03 01:02:36,712 INFO L518 LassoAnalysis]: Proved termination. [2018-12-03 01:02:36,712 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_5, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_5 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2018-12-03 01:02:36,729 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-12-03 01:02:36,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-03 01:02:36,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:36,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:36,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:02:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:36,783 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 [2018-12-03 01:02:36,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 101 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-12-03 01:02:36,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 101 transitions. cyclomatic complexity: 28. Second operand 3 states. Result 83 states and 107 transitions. Complement of second has 4 states. [2018-12-03 01:02:36,803 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 [2018-12-03 01:02:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-03 01:02:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-12-03 01:02:36,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 4 letters. [2018-12-03 01:02:36,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:36,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 33 letters. Loop has 4 letters. [2018-12-03 01:02:36,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:36,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 8 letters. [2018-12-03 01:02:36,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-03 01:02:36,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 107 transitions. [2018-12-03 01:02:36,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-03 01:02:36,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2018-12-03 01:02:36,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-03 01:02:36,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-03 01:02:36,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-03 01:02:36,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:02:36,805 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:02:36,805 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:02:36,805 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:02:36,806 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-03 01:02:36,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-03 01:02:36,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-03 01:02:36,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-03 01:02:36,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 03.12 01:02:36 BoogieIcfgContainer [2018-12-03 01:02:36,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-03 01:02:36,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:02:36,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:02:36,810 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:02:36,810 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:02:24" (3/4) ... [2018-12-03 01:02:36,813 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 01:02:36,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:02:36,813 INFO L168 Benchmark]: Toolchain (without parser) took 12343.81 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.1 MB). Free memory was 954.4 MB in the beginning and 1.4 GB in the end (delta: -429.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:02:36,814 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:02:36,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.46 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:02:36,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.56 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:02:36,815 INFO L168 Benchmark]: Boogie Preprocessor took 51.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:02:36,815 INFO L168 Benchmark]: RCFGBuilder took 222.46 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-12-03 01:02:36,816 INFO L168 Benchmark]: BuchiAutomizer took 11899.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -277.2 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:02:36,816 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:02:36,818 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.46 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.56 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 222.46 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11899.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -277.2 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 10 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 4 locations. One deterministic module has affine ranking function -1 * x + -4 * i + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 8.7s. Construction of modules took 1.0s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 171 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 92 states and ocurred in iteration 10. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 238 SDtfs, 609 SDslu, 315 SDs, 0 SdLazy, 1934 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital399 mio100 ax100 hnf99 lsp87 ukn69 mio100 lsp42 div121 bol100 ite100 ukn100 eq157 hnf80 smp83 dnf175 smp64 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 3 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...